Analysis and Synthesis of Weighted Marked Graph Petri Nets - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2018

Analysis and Synthesis of Weighted Marked Graph Petri Nets

Résumé

Numerous real-world systems can be modeled with Petri nets, which allow a combination of concurrency with synchronizations and conflicts. To alleviate the difficulty of checking their behaviour, a common approach consists in studying specific subclasses. In the converse problem of Petri net synthesis, a Petri net of some subclass has to be constructed efficiently from a given specification, typically from a labelled transition system describing the behaviour of the desired net. In this paper, we focus on a notorious subclass of persistent Petri nets, the weighted marked graphs (WMGs), also called generalised (or weighted) event (or marked) graphs or weighted T-nets. In such nets, edges have multiplicities (weights) and each place has at most one ingoing and one outgoing transition. Although extensively studied in previous works and benefiting from strong results, both their analysis and synthesis can be further investigated. To this end, we provide new conditions delineating more precisely their behaviour and give a dedicated synthesis procedure.
Fichier principal
Vignette du fichier
Petri Nets 2018.pdf (492.2 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02127849 , version 1 (13-05-2019)

Identifiants

  • HAL Id : hal-02127849 , version 1

Citer

Raymond Devillers, Thomas Hujsa. Analysis and Synthesis of Weighted Marked Graph Petri Nets. 39th International Conference, PETRI NETS 2018, Bratislava, Slovakia, June 24-29, 2018, Proceedings, pp.19-39, 2018. ⟨hal-02127849⟩

Collections

TDS-MACS
24 Consultations
325 Téléchargements

Partager

Gmail Facebook X LinkedIn More