 |
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.
Cited literature [6 references]
https://hal.archives-ouvertes.fr/hal-00340494
Contributor : Frédéric Davesne <>
Submitted on : Wednesday, October 9, 2019 - 6:01:30 PM
Last modification on : Monday, October 28, 2019 - 10:24:08 AM
Contributor : Frédéric Davesne <>
Submitted on : Wednesday, October 9, 2019 - 6:01:30 PM
Last modification on : Monday, October 28, 2019 - 10:24:08 AM
