Skip to main content
SpringerLink
Log in
Book cover

International Computing and Combinatorics Conference

COCOON 2003: Computing and Combinatorics pp 149–158Cite as

Petri Nets with Simple Circuits

  • Conference paper
  • First Online:

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

Abstract

We study the complexity of the reachability problem for a new subclass of Petri nets called simple-circuit Petri nets, which properly contains several well known subclasses such as conflict-free, BPP, normal Petri nets and more. A new decomposition approach is applied to developing an integer linear programming formulation for characterizing the reachability sets of such Petri nets. Consequently, the reachability problem is shown to be NP-complete. The model checking problem for some temporal logics is also investigated for simple-circuit Petri nets.

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. Esparza, J. Petri nets, commutative context-free grammars and basic parallel processes, Fundamenta Informaticae 30, 24–41, 1997.

    MathSciNet  Google Scholar 

  2. Esparza, J. Decidability of model checking for infinite-state concurrent systems, Acta Inform. 34, 85–107, 1997.

    Article  MathSciNet  Google Scholar 

  3. Fribourg, L. Petri nets, flat languages and linear arithmetic. 9th Int. Workshop. on Functional and Logic Programming, pp. 344–365, 2000.

    Google Scholar 

  4. Fribourg, L. and Olsén, H. Proving safety properties of infinite state systems by compilation into Presburger arithmetic, LNCS 1243, 213–227, 1997.

    Google Scholar 

  5. Fribourg, L. and Olsén, H. A decompositional approach for computing least fixed-points of datalog programs with z-counters, Constraints, An International Journal 2, 305–335, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  6. Howell, R. and Rosier, L. On questions of fairness and temporal logic for conflict-free Petri nets, In G. Rozenberg, editor, Advances in Petri Nets, LNCS 340, 200–226, Springer-Verlag, Berlin, 1988.

    Google Scholar 

  7. Howell, R., Rosier, L. and Yen, H. Normal and sinkless Petri nets, J. of Computer and System Sciences 46, 1–26, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  8. Ichikawa, A. and Hiraishi, K. Analysis and control of discrete event systems represented by Petri nets, LNCIS 103, 115–134, 1987.

    MathSciNet  Google Scholar 

  9. Kosaraju, R. Decidability of reachability in vector addition systems, Proc. the 14th Annual ACM Symposium on Theory of Computing, 267–280, 1982.

    Google Scholar 

  10. Lipton, R. The reachability problem requires exponential space, Technical Report 62, Yale University, Dept. of CS., Jan. 1976.

    Google Scholar 

  11. Mayr, E. An algorithm for the general Petri net reachability problem, SIAM J. Comput. 13, 441–460, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  12. Mayr, R. Weak bisimulation and model checking for basic parallel processes, Proc. FSTTCS’96, LNCS 1180, 88–99, 1996.

    Google Scholar 

  13. Murata, T. Petri nets: properties, analysis and applications, Proc. Of the IEEE 77(4), 541–580, 1989.

    Article  Google Scholar 

  14. Olsén, H. Automatic verification of Petri nets in a CLP framework, Ph.D. Thesis, Dept. of Computer and Information Science, IDA, Linköping Univ., 1997.

    Google Scholar 

  15. Yamasaki, H. Normal Petri nets, Theoretical Comput. Science 31, 307–315, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  16. Yen, H. A unified approach for deciding the existence of certain Petri net paths, Inform. and Comput., 96(1), 119–137, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  17. Yen, H. On the regularity of Petri net languages, Inform. and Comput., 124(2), 168–181, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  18. Yen, H. On reachability equivalence for BPP-nets, Theoretical Computer Science, 179, 301–317, 1997.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical Eng., National Taiwan University, Taipei, Taiwan, R.O.C.

    Hsu-Chun Yen & Lien-Po Yu

Authors
  1. Hsu-Chun Yen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lien-Po Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Austin, One University Station, C0500, Austin, TX, 78712, USA

    Tandy Warnow

  2. Department of Computer Science, Montana State University, EPS 357, Bozeman, MT, 59717, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yen, HC., Yu, LP. (2003). Petri Nets with Simple Circuits. In: Warnow, T., Zhu, B. (eds) Computing and Combinatorics. COCOON 2003. Lecture Notes in Computer Science, vol 2697. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45071-8_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45071-8_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40534-4

  • Online ISBN: 978-3-540-45071-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation