Characterizing liveness of petri nets in terms of siphons

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2360 LNCS, Issue , 2002, Pages 203-216

  Jiao, Li ^a,b   Cheung, To Yat ^a   Lu, Weiming ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Asymmetric choice net; Characterization; Homogeneous; Live; Liveness monotonicity; Petri net; Siphon

Indexed keywords

PETRI NETS; CHARACTERIZATION;

ASYMMETRIC CHOICE NET; HOMOGENEOUS; LIVE; LIVENESS; MONOTONICITY; NON-LIVENESS;

SIPHONS;

EID: 23044533062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48068-4_13     Document Type: Conference Paper

References (20)

1. Murata, T.: Petri Nets: Properties, Analysis, and Applications. Proceedings of the IEEE, Vol. 77, No. 4 (1989) 541-580: The Stanford Digital Library Metadata Architecture. Int. J. Digit. Libr. 1 (1997) 108.121.
2. Esparza, J.: Reduction and Synthesis of Live and Bounded Free Choice Petri Nets. Information and Computation, Vol. 114, No. 1 (1994) 50-87.
3. Mak, W. M.: Verifying Property Preservation for Component-Based Software Systems (A Petri-net Based Methodology). PhD Thesis, Dept. of Computer Science, City University of Hong Kong, June 2001.
4. Suzuki, I. and Murata, T.: A Method for Stepwise Refinement and Abstraction of Petri Nets. Journal of Computer and System Sciences, Vol. 27 (1983) 51-76.
5. Cheung, T. Y. and Zeng, W.: Invariant-preserving Transformations for the Verification of Place/Transition Systems. IEEE Transactions on Systems, Man and Cybernetics . Part A: Systems and Humans, Vol. 28, No.1 (1998) 114-121.
6. Esparza, J. and Silva, M.: On the Analysis and Synthesis of Free Choice Systems. Lecture Notes in Computer Science, Vol. 483. Springer-Verlag, (1990) 243-286.
7. Best, E.: Structure Theory of Petri Nets: The Free Choice Hiatus. Lecture Notes in Computer Science, Vol. 254. Springer-Verlag, (1987) 168-205.
8. Sliva, M., Teruel, E. and Colom, J. M.: Linear Algebraic and Linear Programming Techniques for the Analysis of Place/Transition Net Systems. Lecture Notes in Computer Science, Vol. 1491. Springer-Verlag, (1998) 309-373.
9. Chu, F. and Xie, X.: Deadlock Analysis of Petri Nets Using Siphon and Mathematical Programming. IEEE Trans. on Robotics and Automation, Vol. 13, No.6 (1997) 793-804.
10. Desel, J. and Esparza, T.: Free Choice Petri Nets. Cambridge University Press (1995).
11. Barkaoui, K. and Pradat-Peyre, J.: On Liveness and Controlled Siphons in Petri Nets. Lecture Notes in Computer Science, Vol. 1091. Springer-Verlag, (1996) 57-72.
12. Zhen, Q. and Lu, W. M.: On Liveness and Safeness of Asymmetric Choice Nets. Journal of Chinese Software, Vol. 11, No.5 (2000) 590-605.
13. Barkaoui, K., Couvreur, J. M. and Dutheiliet C.: On Liveness in Extended Non Self-Controlling Nets. Lecture Notes in Computer Science, Vol. 935. Springer-Verlag, (1995) 25-44.
14. Ridder, H. and Lautenbach, K.: Liveness in Bounded Petri Nets Which are covered by t-invariants. Lecture Notes in Computer Science, Vol. 815. Springer-Verlag, (1994) 358-378.
15. Barkaoui, K. and Minoux, M.: A Polynomial-time Graph Algorithm to Decide Liveness of Some Basic Classes of Bounded Petri Nets. Lecture Notes in Computer Science, Vol. 616. Springer-Verlag, (1992) 62-75.
16. Iordache, M. V. and Antsaklis, P. J.: Generalized Conditions for Liveness Enforcement and Deadlock Prevention in Petri Nets. Lecture Notes in Computer Science, Vol. 2075. Springer-Verlag, (2001) 184-203.
17. Souissi, Y.: On Liveness Preservation by Composition of Nets via a Set of Places. Lecture Notes in Computer Science, Vol. 524. Springer-Verlag, (1991) 277-295.
18. Jiao, L., Lu, W. M. and Cheung, T. Y.: On Liveness Monotonicity of Petri Nets. Proceeding of 2001 International Technical Conference on Circuits/Systems, Computers and Communications, Tokushima, Japan (2001) 311-315.
19. Esparza, J. and Silva, M.: A Polynomial-time Algorithm to Decide Liveness of Bounded Free Choice Nets. Theoretical Computer Science 102 (1992) 185-205.
20. Holk, M.: Analysis of Production Schemata by Petri Nets. TR-94, MIT, Project MAC, Boston 1972, (a second version appeared in 1974).