Paper Info
Title
Unfolding Of Petri Nets With Semilinear Reachability Set
Abstract
Petri net is an effective model for concurrent systems. State space of a general Petri net is infinite. Even if it is finite, its size grows exponentially as the size of the net does. This problem. called state space explosion, makes Petri net analysis hard. Unfolding is suggested to give a compact description of the state space of a bounded Petri net. This is extended to unbounded net using symbol omega used in the coverability tree generating algorithm. However, using w causes lack of information. On the other hand, if unbounded Petri net has a semilinear state space, it can be expressed without lack of information with extended coverability tree. This paper suggests an extension of unfolding of Petri net with semilinear state space without lack of information.
Year
DOI
Venue
2004
10.1109/ISCAS.2004.1329050
2004 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 4, PROCEEDINGS
Keywords
Field
DocType
generic algorithm,information science,tree data structures,petri net,state space,vectors,petri nets,set theory
Set theory,Discrete mathematics,Petri net,Computer science,Stochastic Petri net,Reachability,Process architecture,State space,Bounded function
Conference
Citations 
PageRank 
References 
0
0.34
2
Authors
2
Name
Order
Citations
PageRank
atsushi ohta16615.31
Kohkichi Tsuji232.44