48 citations · 207 across the 23 of their papers we have counts for
Showing 2021 · cs.LOShow all
2 papers · 2 filters
cs.LO2021
Coverability, Termination, and Finiteness in Recursive Petri Nets
Alain Finkel, Serge Haddad, Igor Khmelnitsky
In the early two-thousands, Recursive Petri nets have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessar…
cs.LO2021★ 6 cited
Bounded Reachability Problems are Decidable in FIFO Machines
Benedikt Bollig, Alain Finkel, Amrita Suresh
The undecidability of basic decision problems for general FIFO machines such as reachability and unboundedness is well-known. In this paper, we provide an underapproximation for th…