Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Hierarchical Reachability Graph Generation for Petri Nets

Hierarchical Reachability Graph Generation for Petri Nets Reachability analysis is the most general approach to the analysis of Petri nets. Due to the well-known problem of state-space explosion, generation of the reachability set and reachability graph with the known approaches often becomes intractable even for moderately sized nets. This paper presents a new method to generate and 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 complete information about reachable markings and possible transitions. Consequently, all properties that it is possible for the reachability graph to decide can be decided using the Kronecker representation. The central idea of the new technique is a divide and conquer approach. Based on net-level results, nets are decomposed, and reachability graphs for parts are generated and combined. The whole approach can be realized in a completely automated way and has been integrated in a Petri net-based analysis tool. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Formal Methods in System Design Springer Journals

Hierarchical Reachability Graph Generation for Petri Nets

Download PDF
35 pages

Loading next page...
 
/lp/springer-journals/hierarchical-reachability-graph-generation-for-petri-nets-WkGyS1V4Vy

References (52)

Publisher
Springer Journals
Copyright
Copyright © 2002 by Kluwer Academic Publishers
Subject
Engineering; Circuits and Systems; Electrical Engineering; Computer-Aided Engineering (CAD, CAE) and Design; Software Engineering/Programming and Operating Systems
ISSN
0925-9856
eISSN
1572-8102
DOI
10.1023/A:1020321222420
Publisher site
See Article on Publisher Site

Abstract

Reachability analysis is the most general approach to the analysis of Petri nets. Due to the well-known problem of state-space explosion, generation of the reachability set and reachability graph with the known approaches often becomes intractable even for moderately sized nets. This paper presents a new method to generate and 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 complete information about reachable markings and possible transitions. Consequently, all properties that it is possible for the reachability graph to decide can be decided using the Kronecker representation. The central idea of the new technique is a divide and conquer approach. Based on net-level results, nets are decomposed, and reachability graphs for parts are generated and combined. The whole approach can be realized in a completely automated way and has been integrated in a Petri net-based analysis tool.

Journal

Formal Methods in System Design – Springer Journals

Published: Oct 12, 2004

There are no references for this article.