Coverability, Termination, and Finiteness in Recursive Petri Nets - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2022

Coverability, Termination, and Finiteness in Recursive Petri Nets

Alain Finkel
Serge Haddad
  • Fonction : Auteur
  • PersonId : 1303272
Igor Khmelnitsky
  • Fonction : Auteur
  • PersonId : 1303273

Résumé

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 context-free grammars, most of the usual problems (reachability, coverability, finiteness, boundedness and termination) were known to be solvable by using non-primitive recursive algorithms. 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, termination, boundedness and finiteness 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 a more powerful model than Petri net for free.
Fichier principal
Vignette du fichier
main.pdf (627.62 Ko) Télécharger le fichier
publiée-fi183(1-2)03.pdf (456.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04270919 , version 1 (13-11-2023)

Licence

Paternité

Identifiants

Citer

Alain Finkel, Serge Haddad, Igor Khmelnitsky. Coverability, Termination, and Finiteness in Recursive Petri Nets. Fundamenta Informaticae, 2022, 183, pp.33 - 66. ⟨10.3233/fi-2021-2081⟩. ⟨hal-04270919⟩
35 Consultations
10 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More