107 citations · 618 across the 21 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.FL2019★ 5 cited
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…
cs.LO2019★ 62 cited
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…
cs.LO2019★ 5 cited
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…