Skip to Main content Skip to Navigation
Conference papers

Coverability and Termination in Recursive Petri Nets

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download
Contributor : Igor Khmelnitsky Connect in order to contact the contributor
Submitted on : Tuesday, April 16, 2019 - 1:56:40 PM
Last modification on : Friday, April 30, 2021 - 10:05:13 AM


Coverability and Termination i...
Files produced by the author(s)


  • 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⟩



Les métriques sont temporairement indisponibles