Skip to main content
SpringerLink
Log in

Notes on liveness and boundedness of extended strong asymmetric choice nets II

  • Correspondence
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

In this paper, the Extended Strong Asymmetric Choice Nets II (ESACN II), a subclass of Asymmetric Choice Nets (ACN) including Extended Free Choice Nets (EFCN) and Strong Asymmetric Choice Nets II (SACN II), is presented. A necessary and sufficient condition for liveness of ESACN II is proposed. Moreover, a criterion is introduced, which is necessary and sufficient for judgement of liveness and boundedness of ESACN II. Meanwhile a polynomial time algorithm is given to decide liveness and boundedness for ESACN II.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Murata T. Petri nets, properties, analysis and application. InProc.IEEE, 1989, 77(4): 541–580.

  2. Commoner F. Marked directed graphs.J. Comput. Syst. Sci., 1971, 5: 511–523.

    MATH  MathSciNet  Google Scholar 

  3. Barkaoui K. On Liveness in Extended Non Self-Controlling Nets. InApplication and Theory of Petri Nets 1995, LNCS 935, Springer-Verlag, 1995, pp.23–44.

  4. Esparza J, Silva M. A polynomial-time algorithm to decide liveness of bounded free-choice nets.Theoretical Computer Science, 1992, 102: 185–205.

    Article  MATH  MathSciNet  Google Scholar 

  5. Kemper P, Bause F. An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets. InApplication and Theory of Petri Nets 1992, LNCS 616, Springer-Verlag, 1992, pp.263–278.

  6. Barkaoui K, Pradat-Peyre J. On Liveness and Controlled Siphons in Petri Nets. InApplication and Theory of Petri Nets 1996, LNCS 1091, Springer-Verlag, 1996, pp.56–72.

  7. Kevin X He, Michael D Lemmon. Liveness Verification of Discrete Event Systems Modeled byn-Safe Ordinary Petri Nets. InApplication and Theory of Petri nets 2000, LNCS 1825, Springer-Verlag, 2000, pp.227–243.

  8. ZHEN Qiang. On liveness and boundedness of asymmetric choice nets [Dissertation]. Institute of Mathematics, The Chinese Academy of Scences, 1998. (in Chinese)

  9. ZHEN Qiang, LU Weiming. On liveness of asymmetric choice nets.Journal of Software, 1998, 9 (5): 354–359. (in Chinese)

    Google Scholar 

  10. ZHEN Qiang, LU Weiming. On liveness and safeness for weighted extended FC nets.Journal of Software, 2000, 11(3): 300–307.

    Google Scholar 

  11. LU Weiming, ZHEN Qiang. The study of Petri net system liveness.Journal of Computer Science, 1999, 26(4): (in Chinese)

  12. JIAO Li, LU Weiming. A polynomial time judgement for liveness of asymmetric choice nets.Journal of Software, to appear.

  13. Hack M. Analysis of production schemata by Petri nets [Thesis]. Cambridge, Mass.: MIT, Dept. E.E., 1972.

    Google Scholar 

  14. Mehlhorn K. Data Structure and Algorithms 2: Graph Algorithms and NP-Completeness. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin Heidelberg 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Computer Science, Institute of Mathematics, Academy of Mathematics and System Science, The Chinese Academy of Sciences, 100080, Beijing, P.R. China

    Jiao Li & Lu Weiming

Authors
  1. Jiao Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lu Weiming
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jiao Li.

Additional information

Partially supported by the National Natural Science Foundation of China (No.60073013) and the NKBRSF of China (No.G1998030416).

JIAO Li was born in 1964. She received the Ph.D. degree in computer science from the Institute of Mathematics, The Chinese Academy of Sciences in 2001. Her research interests are Petri nets and algorithms.

LU Weiming was born in 1941. He is a professor and a doctoral supervisor of the Institute of Mathematics, The Chinese Academy of Sciences. His current research areas cover Petri nets, algorithms and software technology.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jiao, L., Lu, W. Notes on liveness and boundedness of extended strong asymmetric choice nets II. J. Comput. Sci. & Technol. 16, 426–433 (2001). https://doi.org/10.1007/BF02948960

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948960

Keywords

Search

Navigation