107 citations · 618 across the 21 of their papers we have counts for
21 papers
Games on Graphs: From Logic and Automata to Algorithms
Nathanaël Fijalkow, C. Aiswarya, Guy Avni +22
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared…
On the Computation of the Zariski Closure of Finitely Generated Groups of Matrices
Klara Nosan, Amaury Pouly, Sylvain Schmitz +2
We investigate the complexity of computing the Zariski closure of a finitely generated group of matrices. The Zariski closure was previously shown to be computable by Derksen, Jean…
Coverability is Undecidable in One-dimensional Pushdown Vector Addition Systems with Resets
Sylvain Schmitz, Georg Zetzsche
We consider the model of pushdown vector addition systems with resets. These consist of vector addition systems that have access to a pushdown stack and have instructions to reset…
Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Dimension
Jérôme Leroux, Sylvain Schmitz
The reachability problem in vector addition systems is a central question, not only for the static verification of these systems, but also for many inter-reducible decision problem…
Bisimulation Equivalence of First-Order Grammars is ACKERMANN-Complete
Petr Jančar, Sylvain Schmitz
Checking whether two pushdown automata with restricted silent actions are weakly bisimilar was shown decidable by Sénizergues (1998, 2005). We provide the first known complexity up…
On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders
Mirna Džamonja, Sylvain Schmitz, Philippe Schnoebelen
We investigate the ordinal invariants height, length, and width of well quasi orders (WQO), with particular emphasis on width, an invariant of interest for the larger class of orde…