par Pommereau, Franck;Devillers, Raymond ;Klaudel, Hanna
Référence Electronic Notes in Theoretical Computer Science, 239, C, page (119-129)
Publication Publié, 2009-07
Article révisé par les pairs
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. © 2009 Elsevier B.V. All rights reserved.