A Petri Net Synthesis Method

2010 ◽  
Vol 5 (6) ◽  
Author(s):  
Chuanliang Xia
2014 ◽  
Vol 24 (5) ◽  
Author(s):  
CHUANLIANG XIA

We provide motivation for and then study the synthesis of Petri nets. Synthesis can avoid the state exploration problem by guaranteeing correctness for the Petri net. We propose conditions to be imposed on a synthesis shared pb-type subnet for systems specified in Petri nets that ensure the preservation of the liveness and boundedness structural properties. Specifically, we propose a group of sufficient conditions, or both sufficient and necessary conditions, for liveness preservation and boundedness preservation. Possible applications of this synthesis method are illustrated through an example in the form of a flexible manufacturing system. These results are useful for studying the static and dynamic properties of Petri nets for analysing the properties of large complex systems.


2011 ◽  
Vol 255-260 ◽  
pp. 1989-1993
Author(s):  
Chuan Liang Xia ◽  
Zhen Dong Liu ◽  
Peng Sun

Petri net synthesis can avoid the state exploration problem by guaranteeing the correctness in the Petri net while incrementally expanding the net. This paper proposes the conditions imposed on a synthesis shared a kind of subnet under which the following structural properties will be preserved: repetitiveness, consistency, structural boundedness, conservativeness, structural liveness, P-invariant and T-invariant.


Author(s):  
Ekkart Kindler ◽  
Vladimir Rubin ◽  
Wilhelm Schäfer

Author(s):  
Eike Best ◽  
Raymond Devillers ◽  
Evgeny Erofeev ◽  
Harro Wimmel

When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such subclasses of Petri nets is not necessarily computationally more efficient than targeting the whole class. For example, targeting safe nets is known to be NP-complete while targeting the full class of place/transition nets is polynomial, in the size of the transition system. In this paper, several classes of Petri nets are examined, and their suitability for being targeted through efficient synthesis from labelled transition systems is studied and assessed. The focus is on choice-free Petri nets and some of their subclasses. It is described how they can be synthesised efficiently from persistent transition systems, summarising and streamlining in tutorial style some of the authors’ and their groups’ work over the past few years.


IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 161937-161948 ◽  
Author(s):  
Wenjing Luan ◽  
Liang Qi ◽  
Zhongying Zhao ◽  
Jianxin Liu ◽  
Yuyue Du

Sign in / Sign up

Export Citation Format

Share Document