Accéder directement au contenu Accéder directement à la navigation
Communication dans un congrès

Dynamic Recursive Petri Nets

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.
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-02511321
Contributeur : Igor Khmelnitsky <>
Soumis le : mercredi 18 mars 2020 - 16:39:52
Dernière modification le : jeudi 19 mars 2020 - 01:32:07

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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

Partager

Métriques

Consultations de la notice

56

Téléchargements de fichiers

94