Views
3 years ago

Hierarchical Reachability Graph Generation for Petri Nets

Hierarchical Reachability Graph Generation for Petri Nets

Hierarchical Reachability Graph Generation for Petri

Formal Methods in System Design, 21, 281–315, 2002c○ 2002 Kluwer Academic Publishers. Manufactured in The Netherlands.Hierarchical Reachability Graph Generationfor Petri NetsPETER BUCHHOLZFakultät Informatik, TU Dresden, D-01062 Dresden, Germanyp.buchholz@inf.tu-dresden.dePETER KEMPERInformatik IV, Universität Dortmund, D-44221 Dortmund, Germanykemper@ls4.cs.uni-dortmund.deReceived November 18, 1997; Accepted December 3, 2001Abstract. Reachability analysis is the most general approach to the analysis of Petri nets. Due to the wellknownproblem of state-space explosion, generation of the reachability set and reachability graph with the knownapproaches often becomes intractable even for moderately sized nets. This paper presents a new method to generateand represent the reachability set and reachability graph of large Petri nets in a compositional and hierarchical way.The representation is related to previously known Kronecker-based representations, and contains the completeinformation about reachable markings and possible transitions. Consequently, all properties that it is possible forthe reachability graph to decide can be decided using the Kronecker representation. The central idea of the newtechnique is a divide and conquer approach. Based on net-level results, nets are decomposed, and reachabilitygraphs for parts are generated and combined. The whole approach can be realized in a completely automated wayand has been integrated in a Petri net-based analysis tool.Keywords:Petri nets, reachability set, reachability graph, hierarchical structure, invariant analysis1. IntroductionPetri nets (PNs) are an established formalism for describing and analyzing dynamic systems.Among the large number of available analysis techniques, the generation of the set ofall reachable markings and all possible transitions is the most general approach that istheoretically applicable for every bounded net. The resulting graph is called the reachabilitygraph (RG) or occurrence graph. The set of reachable markings is called the reachability set(RS). Reachable markings of the PN build the vertices of the graph, and transitions describethe edges. Edges may be labeled with the corresponding transition identifiers from the PNdescription. The RG contains the full information about the dynamic behavior of the PNand can be easily analyzed to gain results about the functional behavior as required for theverification of system properties. RGs are generated by an algorithm computing all successormarkings for discovered markings, starting with the initial marking of the net. This approachis conceptually simple and is integrated in most software tools developed for the analysisof PNs. In practice, unfortunately, the size of RGs often grows exponentially with the sizeof the PN in terms of places and tokens. Hence, RG generation is usable only for relativelysmall nets, much smaller than most practically relevant examples are. Consequently, many

timed extensions of Petri nets
Reachability analysis of a class of Petri nets using place invariants ...
Symbolic Reachability Analysis of Integer Timed Petri Nets
On The Decidability Of MELL: Reachability In Petri Nets With Split ...
Hierarchical Time-Extended Petri Nets (H-EPNs) for Integrated ...
An algorithm for the evolution graph of extended Hybrid Petri nets
Fault Analysis Using Petri Nets (pdf 45kB)
The Application of Petri Net to the Modelling and Analysis of a ...
Introduction into modelling with Petri Nets What are Petri Nets?
Transition systems, link graphs and Petri nets - The Computer ...
Transition systems, link graphs and Petri nets - Inria
A Study of Petri Nets: Modeling, Analysis and Simulation - Tamu.edu
Safety verification of software using structured Petri nets
An Introduction to the Theoretical Aspects of Coloured Petri Nets
NON-HIERARCHICAL HIGH LEVEL PETRI NET EQUIVALENT ...
Petri Nets with Discrete Variables - Computer
Introduction to Generalized Stochastic Petri Nets
Decidability and complexity of Petri net problems – an introduction
Subclasses of Petri nets - Zemris
Decidability results for restricted models of Petri nets with name ...
Subclasses of Petri nets - Zemris