88 citations · 281 across the 25 of their papers we have counts for
Showing 2022 · cs.LOShow all
2 papers · 2 filters
cs.LO2022★ 1 cited
Compiling Petri Net Mutual Reachability in Presburger
Jérôme Leroux
Petri nets are a classical model of concurrency widely used and studied in formal verification with many applications in modeling and analyzing hardware and software, data bases, a…
cs.LO2022★ 1 cited
On the Home-Space Problem for Petri Nets and its Ackermannian Complexity
Petr Jančar, Jérôme Leroux
A set of configurations is a home-space for a set of configurations of aPetri net if every configuration reachable from (any configuration in) can reach (some configura…