2011
DOI: 10.4304/jcp.6.8.1662-1669
|View full text |Cite
|
Sign up to set email alerts
|

Analysis and Application of Petri Subnet Reduction

Abstract: We motivate and study the subnet reduction of Petri nets. Subnet reduction can avoid the state exploration problem by guaranteeing the correctness in the Petri net. For systems specified in Petri nets, this paper proposes two subnet reduction methods. One major advantage of these reduction methods is that the resultant ordinary Petri net is guaranteed to be live, bounded and reversible. A group of sufficient conditions or sufficient and necessary conditions of liveness preservation, boundedness preservation an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2013
2013
2014
2014

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 19 publications
0
1
0
Order By: Relevance
“…Compared with other formal tools, Petri nets are characterized of graphical presentation, solid theoretical foundation in mathematics and various analysis methods [3]- [5]. On become the most important tools to deal with deadlock problems in FMS [6]- [8].…”
Section: Introductionmentioning
confidence: 99%
“…Compared with other formal tools, Petri nets are characterized of graphical presentation, solid theoretical foundation in mathematics and various analysis methods [3]- [5]. On become the most important tools to deal with deadlock problems in FMS [6]- [8].…”
Section: Introductionmentioning
confidence: 99%