Coverability and Termination in Recursive Petri Nets - Archive ouverte HAL Access content directly
Conference Papers Year :

Coverability and Termination in Recursive Petri Nets

Couverture et Terminaison dans les réseaux de Petri Récursifs

(1, 2) , (1, 2, 3) , (1, 2, 3)


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 necessary. Although Recursive Petri nets strictly extend Petri nets and stack automata, most of the usual property problems are solvable but using non primitive recursive algorithms, even for coverability and termination. For almost all other extended Petri nets models containing a stack the complexity of coverability and termination are unknown or strictly larger than EXPSPACE. In contrast, we establish here that for Recursive Petri nets, the coverability and termination problems are EXPSPACE-complete as for Petri nets. From an expressiveness point of view, we show that coverability languages of Recursive Petri nets strictly include the union of coverability languages of Petri nets and context-free languages. Thus we get for free a more powerful model than Petri net.
Fichier principal
Vignette du fichier
Coverability and Termination in Recursive Petri Nets.pdf (464.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02081019 , version 1 (16-04-2019)


  • HAL Id : hal-02081019 , version 1


Alain Finkel, Serge Haddad, Igor Khmelnitsky. Coverability and Termination in Recursive Petri Nets. Petri Nets 2019 / ACSD 2019 - 40th International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2019, Aachen, Germany. ⟨hal-02081019⟩
206 View
531 Download


Gmail Facebook Twitter LinkedIn More