Skip to Main content Skip to Navigation
Conference papers

Dynamic Recursive Petri Nets

Serge Haddad 1 Igor Khmelnitsky 1
1 MEXICO - Modeling and Exploitation of Interaction and Concurrency
Inria Saclay - Ile de France, LSV - Laboratoire Spécification et Vérification
Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/hal-02511321
Contributor : Igor Khmelnitsky <>
Submitted on : Wednesday, March 18, 2020 - 4:39:52 PM
Last modification on : Friday, April 30, 2021 - 10:05:17 AM
Long-term archiving on: : Friday, June 19, 2020 - 2:15:16 PM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02511321, version 1

Citation

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⟩

Share

Metrics

Record views

181

Files downloads

648