35 citations · 70 across the 9 of their papers we have counts for
3 papers · 1 filter
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…
Approaching the Coverability Problem Continuously
Michael Blondin, Alain Finkel, Christoph Haase +1
The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challe…
Interrupt Timed Automata with Auxiliary Clocks and Parameters
Béatrice Bérard, Serge Haddad, Aleksandra Jovanović +1
Interrupt Timed Automata (ITA) is an expressive timed model, introduced to take into account interruptions, according to levels. Due to this feature, this formalism is incomparable…