88 citations · 281 across the 25 of their papers we have counts for
Showing 2015 · cs.LOShow all
2 papers · 2 filters
cs.LO2015★ 10 cited
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…
cs.LO2015★ 88 cited
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…