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.
Type de document :
Communication dans un congrès
9th International Workshops on Verification of Infinite-State Systems (INFINITY 2007), Sep 2007, Lisbon, Portugal. 239, pp.119--129, 2009, Electronic Notes in Theoretical Computer Science. 〈10.1016/j.entcs.2009.05.034〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00340494
Contributeur : Frédéric Davesne <>
Soumis le : jeudi 20 novembre 2008 - 23:59:06
Dernière modification le : jeudi 13 décembre 2018 - 09:46:03

Lien texte intégral

Identifiants

Collections

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. 239, pp.119--129, 2009, Electronic Notes in Theoretical Computer Science. 〈10.1016/j.entcs.2009.05.034〉. 〈hal-00340494〉

Partager

Métriques

Consultations de la notice

165