On liveness and boundedness of asymmetric choice nets

This paper concerns two important techniques, characterization and property-preserving transformation, for verifying some basic properties of asymmetric choice Petri nets (AC nets). In the literature, a majority of the characterizations are for ordinary free choice nets. This paper presents many extended (from free choice nets) and new characterizations for four properties: liveness with respect to an initial marking, liveness monotonicity with respect to an initial marking, well-formedness, liveness and boundedness with respect to an initial marking. The nets involved are extended to homogeneous free choice nets, ordinary AC nets and homogeneous AC nets. This paper also investigates the transformation of merging a set of places of an ordinary AC net and proposes the conditions for it to preserve the siphon-trap-property (ST-property), liveness, boundedness and reversibility. The results are then applied to the verification of resource-sharing systems. At present, the major approaches for solving this problem are based on state machines or marked graphs and are not based on property preservation. Our approach extends the scopes of the underlying nets to AC nets and the verification techniques. It is found that the ST-property plays a very important role in many of the results. Furthermore, mainly through examples, the importance of the assumptions in the proposed characterizations and transformation and the limitation on further extensions are pointed out.

[1]  Manuel Silva Suárez,et al.  Compositional Synthesis of Live and Bounded Free Choice Petri Nets , 1991, CONCUR.

[2]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[3]  Manuel Silva Suárez,et al.  Linear Algebraic and Linear Programming Techniques for the Analysis of Place or Transition Net Systems , 1996, Petri Nets.

[4]  T Murata,et al.  Reduction and expansion of live and safe marked graphs. , 1979 .

[5]  Zhen Qiang On Liveness and Safeness of Asymmetric Choice Nets , 2000 .

[6]  Wil M. P. van der Aalst,et al.  Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques , 2000, Business Process Management.

[7]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[8]  Simon Peck,et al.  Practice of Petri Nets in Manufacturing , 1993 .

[9]  Jörg Desel,et al.  A Proof of the Rank Theorem for Extended Free Choice Nets , 1992, Application and Theory of Petri Nets.

[10]  Javier Martínez,et al.  A Petri net based deadlock prevention policy for flexible manufacturing systems , 1995, IEEE Trans. Robotics Autom..

[11]  Kamel Barkaoui,et al.  On Liveness and Controlled Siphons in Petri Nets , 1996, Application and Theory of Petri Nets.

[12]  Manuel Silva Suárez,et al.  On Linear Algebraic Techniques for Liveness Analysis of P/T Systems , 1998, J. Circuits Syst. Comput..

[13]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[14]  Manuel Silva Suárez,et al.  On the analysis and synthesis of free choice systems , 1991, Applications and Theory of Petri Nets.

[15]  Panos J. Antsaklis,et al.  Generalized Conditions for Liveness Enforcement and Deadlock Prevention in Petri Nets , 2001, ICATPN.

[16]  Xiaolan Xie,et al.  Liveness and Boundedness Analysis for Petri Nets with Event Graph Modules , 1992, Application and Theory of Petri Nets.

[17]  MengChu Zhou,et al.  Petri net synthesis for discrete event control of manufacturing systems , 1992, The Kluwer international series in engineering and computer science.

[18]  Michel Hack,et al.  ANALYSIS OF PRODUCTION SCHEMATA BY PETRI NETS , 1972 .

[19]  Kurt Lautenbach,et al.  Liveness in Bounded Petri Nets Which Are Covered by T-Invariants , 1994, Application and Theory of Petri Nets.

[20]  Yadati Narahari,et al.  A Petri net approach to the modelling and analysis of flexible manufacturing systems , 1985 .

[21]  Javier Esparza Reduction and Synthesis of Live and Bounded Free Choice Petri Nets , 1994, Inf. Comput..

[22]  Weiming Lu,et al.  Characterizing Liveness of Petri Nets in Terms of Siphons , 2002, ICATPN.

[23]  Feng Chu,et al.  Deadlock analysis of Petri nets using siphons and mathematical programming , 1997, IEEE Trans. Robotics Autom..

[24]  Kamel Barkaoui,et al.  On Liveness in Extended non Self-Controlling Nets , 1995, Application and Theory of Petri Nets.

[25]  Ekkart Kindler,et al.  Beyond asymmetric choice : a note on some extensions , 1998 .

[26]  Wei Zeng,et al.  Invariant-preserving transformations for the verification of place/transition systems , 1998, IEEE Trans. Syst. Man Cybern. Part A.

[27]  Falko Bause,et al.  An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets , 1992, Application and Theory of Petri Nets.

[28]  Manuel Silva Suárez,et al.  Structure Theory of Equal Conflict Systems , 1996, Theor. Comput. Sci..

[29]  Ichiro Suzuki,et al.  A Method for Stepwise Refinement and Abstraction of Petri Nets , 1983, J. Comput. Syst. Sci..

[30]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[31]  Tilak Agerwala,et al.  A Synthesis Rule for Concurrent Systems , 1978, 15th Design Automation Conference.