Efficient reachability graph representation of Petri nets with unbounded counters - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Efficient reachability graph representation of Petri nets with unbounded counters

Résumé

In this paper, we define a class of Petri nets, called Petri nets with counters, that can be seen as place/transition Petri nets enriched with a vector of integer variables on which linear operations may be applied. Their semantics usually leads to huge or infinite reachability graphs. Then, a more compact representation for this semantics is defined as a symbolic state graph whose nodes possibly encode infinitely many values for the variables. Both representations are shown behaviourally equivalent.
Fichier principal
Vignette du fichier
PDK-Inf-2007 (1).pdf (358.64 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00340494 , version 1 (09-10-2019)

Identifiants

Citer

Franck Pommereau, Raymond Devillers, Hanna Klaudel. Efficient reachability graph representation of Petri nets with unbounded counters. 9th International Workshops on Verification of Infinite-State Systems (INFINITY 2007), Sep 2007, Lisbon, Portugal. pp.119--129, ⟨10.1016/j.entcs.2009.05.034⟩. ⟨hal-00340494⟩
123 Consultations
130 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More