HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Efficient reachability graph representation of Petri nets with unbounded counters

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.
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download

Contributor : Frédéric Davesne Connect in order to contact the contributor
Submitted on : Wednesday, October 9, 2019 - 6:01:30 PM
Last modification on : Tuesday, February 15, 2022 - 11:24:03 AM



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⟩



Record views


Files downloads