Skip to main content
SpringerLink
Log in
Book cover

International Conference on Application and Theory of Petri Nets

ICATPN 2002: Application and Theory of Petri Nets 2002 pp 203–216Cite as

Characterizing Liveness of Petri Nets in Terms of Siphons

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2360))

Abstract

Several new characterizations relating the liveness, liveness monotonicity and siphons of general and asymmetric choice nets are first proposed in this article. The first major one states that, if a pure ordinary net satisfies liveness monotonicity, then every siphon of it contains at least one trap. The second major one characterizes the non-liveness of an individual transition of a homogeneous asymmetric choice net in terms of some properties of its siphons. Then, based on these new characterizations, extension and new proofs for several existing characterizations of asymmetric choice nets are given.

This research was financially supported by the Research Grant Council of Hong Kong under Grant CityU 1133/99E and CityU 1072/00E and the National Natural Science Foundation of China under Grant No. 60073013.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  Google Scholar 

  2. Esparza, J.: Reduction and Synthesis of Live and Bounded Free Choice Petri Nets. Information and Computation, Vol. 114, No. 1 (1994) 50–87.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Google Scholar 

  7. Best, E.: Structure Theory of Petri Nets: the Free Choice Hiatus. Lecture Notes in Computer Science, Vol. 254. Springer-Verlag, (1987) 168–205.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Article  Google Scholar 

  10. Desel, J. and Esparza, T.: Free Choice Petri Nets. Cambridge University Press (1995).

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  20. Holk, M.: Analysis of Production Schemata by Petri Nets. TR-94, MIT, Project MAC, Boston 1972, (a second version appeared in 1974).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Hong Kong, China

    Li Jiao & To-Yat Cheung

  2. Academy of Mathematics and System Science, Chinese Academy of Sciences, Beijing, China

    Li Jiao & Weiming Lu

Authors
  1. Li Jiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. To-Yat Cheung
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weiming Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Division of Informatics, University of Edinburgh, James Clerk Maxwell Building, The King’s Buildings Mayfield Road, Edinburgh, EH9 3JZ, UK

    Javier Esparza

  2. Department of Computer Science, University of Adelaide, North Terrace, Adelaide, SA, 5005, Australia

    Charles Lakos

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jiao, L., Cheung, TY., Lu, W. (2002). Characterizing Liveness of Petri Nets in Terms of Siphons. In: Esparza, J., Lakos, C. (eds) Application and Theory of Petri Nets 2002. ICATPN 2002. Lecture Notes in Computer Science, vol 2360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48068-4_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-48068-4_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43787-1

  • Online ISBN: 978-3-540-48068-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation