research
∙
02/01/2023
Orbit-finite linear programming
An infinite set is orbit-finite if, up to permutations of the underlying...
share
research
∙
01/22/2022
Solvability of orbit-finite systems of linear equations
We study orbit-finite systems of linear equations, in the setting of set...
research
∙
05/18/2021
Improved Ackermannian lower bound for the VASS reachability problem
This draft is a follow-up of the Ackermannian lower bound for the reacha...
research
∙
04/24/2021
Parikh's theorem for infinite alphabets
We investigate commutative images of languages recognised by register au...
research
∙
12/30/2020
Reachability relations of timed pushdown automata
Timed pushdown automata (TPDA) are an expressive formalism combining rec...
research
∙
12/13/2018
VASS reachability in three steps
This note is a product of digestion of the famous proof of decidability ...
research
∙
09/19/2018
The Reachability Problem for Petri Nets is Not Elementary
Petri nets, also known as vector addition systems, are a long establishe...
research
∙
09/19/2018
The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract)
Petri nets, also known as vector addition systems, are a long establishe...
research
∙
04/28/2018
Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
We study an expressive model of timed pushdown automata extended with mo...
research
∙
02/23/2018
Definable isomorphism problem
We investigate the isomorphism problem in the setting of definable sets ...
research
∙
02/21/2018
WQO dichotomy for 3-graphs
We investigate data-enriched models, like Petri nets with data, where ex...
research
∙
02/19/2018