88 citations · 281 across the 25 of their papers we have counts for
4 papers · 1 filter
Structurally Cyclic Petri Nets
Drewes Frank, Leroux Jérôme
A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial…
On Boundedness Problems for Pushdown Vector Addition Systems
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
We study pushdown vector addition systems, which are synchronized products of pushdown automata with vector addition systems. The question of the boundedness of the reachability se…
On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension
Jérôme Leroux, Grégoire Sutre, Patrick Totzke
Does the trace language of a given vector addition system (VAS) intersect with a given context-free language? This question lies at the heart of several verification questions invo…
Demystifying Reachability in Vector Addition Systems
Jérôme Leroux, Sylvain Schmitz
More than 30 years after their inception, the decidability proofs for reachability in vector addition systems (VAS) still retain much of their mystery. These proofs rely crucially…