Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters

  • Authors:

  • Franck Pommereau;Raymond Devillers;Hanna Klaudel

  • Affiliations:

  • LACL, Université Paris 12. 61 avenue du général de Gaulle. 94010 Créteil, France;Département d'Informatique, Université Libre de Bruxelles. CP212, B-1050 Bruxelles, Belgium;IBISC, FRE 2873 CNRS, Université Evry-Val d'Essonne. 91000 Evry, France

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

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.