Abstract
The problem of state-space explosion and state reachability decision has been a focus in Petri net analysis. In this article, some algorithms based on data features of state space are proposed for ...
Highlights
The size of a state space has a tendency of growing exponentially with respect to the structural scale of a Petri net, which is known as the state-space explosion problem (S2EP).[46]
In this article, focusing on data characteristics of the state space in Petri nets, we propose three algorithms to deal with the S2EP and state reachability analysis (SRA) problems
In order to alleviate the storage issue caused by the state explosion before compressing the state space, a caching arrangement algorithm of the reachability graph shown in Table 1 is proposed as follows
Summary
A formal modeling tool invented by CA Petri,[1] have been applied to many fields, such as control of discrete event systems,[2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17] system reliability analysis,[18,19,20,21,22,23] modeling, analysis, control,[24,25,26,27,28,29,30,31,32,33] and the verification of communication protocol.[34]. The unfolding will be ceased when the occurrence net structure generated is sufficient to characterize all the reachable markings This occurrence net, simplifying the overlapping transitions among concurrent events, avoids the state explosion problem in the process of searching the whole state space. In this article, focusing on data characteristics of the state space in Petri nets, we propose three algorithms to deal with the S2EP and SRA problems. A marking M called a state of a Petri net N is a mapping P to N, where M(p) denotes the number of tokens in place p. In order to alleviate the storage issue caused by the state explosion before compressing the state space, a caching arrangement algorithm of the reachability graph shown in Table 1 is proposed as follows. Initializing the counter of reachable States n and the maximum caching states MaxNum
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
