Efficient reachability graph representation of Petri nets with unbounded counters

Franck Pommereau 1 Raymond Devillers 2 Hanna Klaudel 3
1 LACL - Laboratoire d'Algorithmique Complexité et Logique
2 SSD - Systèmes Distribués
3 LIS
IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
Abstract : 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.
Keywords : Petri nets reachability traces unbounded integers
Document type :
Conference papers
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-00340494
Contributor : Frédéric Davesne <>
Submitted on : Thursday, November 20, 2008 - 11:59:06 PM
Last modification on : Thursday, December 13, 2018 - 9:46:03 AM

Links full text

openaccess

Identifiers

Collections

UNIV-EVRY | LACL | UPEC | UPEC-UPEM | IBISC | IBISC-COSMO

Citation

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⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

178

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD