Dynamic Recursive Petri Nets - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Dynamic Recursive Petri Nets


In the early two-thousands, Recursive Petri nets (RPN) have been introduced in order to model distributed planning of multi-agent systems for which counters and recursivity were necessary. While having a great expressive power, RPN suffer two limitations: (1) they do not include more general features for transitions like reset arcs, transfer arcs, etc. (2) the initial marking associated the recursive "call" only depends on the calling transition and not on the current marking of the caller. Here we introduce Dynamic Recursive Petri nets (DRPN) which address these issues. We show that the standard extensions of Petri nets for which decidability of the coverability problem is preserved are particular cases of DPRN. Then we establish that w.r.t. coverability languages, DRPN are strictly more expressive than RPN. Finally we prove that the coverability problem is still decidable for DRPN.
Fichier principal
Vignette du fichier
main.pdf (455.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02511321 , version 1 (18-03-2020)


  • HAL Id : hal-02511321 , version 1


Serge Haddad, Igor Khmelnitsky. Dynamic Recursive Petri Nets. PETRI NETS 2020 - 41st International Conference on Application and Theory of Petri Nets and Concurrency, Jun 2020, Paris, France. ⟨hal-02511321⟩
161 View
183 Download


Gmail Facebook Twitter LinkedIn More