Analysis of Properties of Petri Synthesis Net

Xia, Chuanliang

doi:10.1007/11750321_55

Cited by 12 publications

(13 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In Fig.5.2, 12 11 , p p :Registered material; 13 p :Complaint information; 14 p :Reaction information of respondent department; 15 p : Result of a processing; 16 p : Collected information materials; 11 t : Register a complaint; 12 t : Contact client and get more information; 13 t : Inform respondent department and get reaction information; 14 t : Collect information materials; 15 t : Archive a complaint together with a questionnaire. The pp-type subnet pp N is illustrated in Fig.5.3.…”

Section: Applicationsmentioning

confidence: 99%

See 1 more Smart Citation

Property Preservation by Petri-Net-Based Refinements in System Design

Xia

2008

2008 the 9th International Conference for Young Computer Scientists

Self Cite

View full text Add to dashboard Cite

We motivate and study the refinements of places and transitions in Petri nets. A refinement of Petri nets is a transformation by replacing a simple entity of a system with its functional and operational details. In general, the refined system may become incorrect even if the original system is correct because some of its original properties may have been lost or some undesired properties may have been created. For systems specified in ordinary Petri nets, this paper proposes the conditions imposed on two types of refinements under which the following properties will be preserved: liveness, boundedness, reversibility, and fairness. Such results release the designer's burden for having to provide different methods for individual properties.

show abstract

Section: Applicationsmentioning

confidence: 99%

“…Narahari [11] investigated the following properties of the merged system: absence of deadlocks, conservativeness and boundedness. Xia [12] investigated property preservations of synthesis Petri nets. Juhás [13] presented a methodology for synthesis of controlled behavior for systems modelled by modules of signal sets.…”

Section: Introductionmentioning

confidence: 99%

Property Preservation by Petri-Net-Based Refinements in System Design

Xia

2008

2008 the 9th International Conference for Young Computer Scientists

Self Cite

View full text Add to dashboard Cite

show abstract

“…Note that in [10,11], we proposed a kind of pp-type refinement and a kind of tt-type refinement, and proved that these two kinds of refinements preserve some dynamic properties , such as boundedness, liveness and reversibility. In this paper we will prove that this tt-type refinement will preserve some important structural properties, such as repetitiveness, consistency, T-invariant, structural boundedness, conservativeness and P-invariant.…”

Section: Introduction Inmentioning

confidence: 96%

Structural Property Preservation of a Kind of Petri Net Refinement

Xia

2008

2008 International Symposium on Information Science and Engineering

View full text Add to dashboard Cite

A refinement of Petri nets is a transformation by replacing a simple entity of a system with its functional and operational details. In general, the refined system may become incorrect even if the original system is correct because some of its original properties may have been lost or some undesired properties may have been created. For systems specified in ordinary Petri nets, this paper proposes the conditions imposed on a kind of net refinement under which the following structural properties will be preserved: repetitiveness, consistency, T-invariant, structural boundedness, conservativeness and P-invariant.

show abstract

“…A module synthesis method of EN-system was presented in [17]. The refinement and abstract representation method of Petri net is proposed [18], which is the key method to ensure the synthesis net preserving the well-behaved properties. Conditions of structural liveness preservation of a kind of Petri synthesis net is proposed [19].…”

Section: Introductionmentioning

confidence: 99%

Analysis and Application of Petri Subnet Reduction

Xia¹

2011

JCP

Self Cite

View full text Add to dashboard Cite

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 and reversibility preservation are proposed. A flexible manufacturing system has been verified. These results are useful for studying the static and dynamic properties of Petri nets, analyzing properties for large complex system

show abstract

Analysis of Properties of Petri Synthesis Net

Cited by 12 publications

References 10 publications

Property Preservation by Petri-Net-Based Refinements in System Design

Property Preservation by Petri-Net-Based Refinements in System Design

Structural Property Preservation of a Kind of Petri Net Refinement

Analysis and Application of Petri Subnet Reduction

Contact Info

Product

Resources

About