Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters | Zendy

Franck Pommereau | Zendy; Raymond Devillers | Zendy; Hanna Klaudel | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters

Author(s) -

Franck Pommereau,

Raymond Devillers,

Hanna Klaudel

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2009.05.034

Subject(s) - petri net , reachability , graph , computer science , stochastic petri net , semantics (computer science) , theoretical computer science , representation (politics) , reachability problem , encode , discrete mathematics , mathematics , programming language , biochemistry , chemistry , politics , political science , law , gene

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.SCOPUS: ar.jinfo:eu-repo/semantics/publishe

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research