Skip to main content
SpringerLink
Log in

Hsu-Chun Yen

Introduction to Petri Net Theory

  • Chapter
Recent Advances in Formal Languages and Applications

Part of the book series: Studies in Computational Intelligence ((SCI,volume 25))

  • 569 Accesses

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

Access this chapter

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Agerwala and M. Flynn. Comments on capabilities, limitations and ‘correctness’ of Petri nets, Proc. of 1st Annual Symposium on Computer Architecture, 1973,81-86.

    Google Scholar 

  2. H. Baker. Rabin’s proof of the undecidability of the reachability set inclusion problem of vector addition systems, Computation Structures Group Memo 79, Project MAC, MIT, July 1973.

    Google Scholar 

  3. I. Borosh, and L. Treybig. Bounds on positive integral solutions of linear Diophantine equations, Proc. Amer. Math. Soc. 55 (1976), 299-304.

    Article  MATH  MathSciNet  Google Scholar 

  4. L. Cherkasova, R. Howell and L. Rosier. Bounded self-stabilizing Petri nets, Acta Informatica, 32 (1995), 189-207.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Clote. On the finite containment problem for Petri nets, Theoretical Computer Science, 43 (1986), 99-105.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Davis. Hilbert’s tenth problem is unsolvable, American Mathematical Monthly, 80 (1973), 233-269.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. Desel and J. Esparza. Free Choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995.

    Google Scholar 

  8. E. Dijkstra. Self-stabilizing systems in spite of distributed control, C. ACM, 17 (1974),643-644.

    Article  MATH  Google Scholar 

  9. C. Dufourd, P. Jancar and P. Schnoebelen. Boundedness of reset P/T nets, Int’l Colloquium on Automata, Languages and Programming, LNCS 1644, SpringerVerlag, Berlin, 1999, 301-310.

    Google Scholar 

  10. J. Esparza. Petri nets, commutative context-free grammars and basic parallel processes, Fundamenta Informaticae, 30 (1997), 24-41.

    MathSciNet  Google Scholar 

  11. J. Esparza. Decidability of model checking for infinite-state concurrent systems, Acta Informatica, 34 (1997), 85-107.

    Article  MathSciNet  Google Scholar 

  12. J. Esparza. Decidability and complexity of Petri net problems : an introduction, Lectures on Petri Nets I: Basic Models. Advances in Petri Nets (G. Rozenberg, W. Reisig, eds.), LNCS 1491, Springer-Verlag, Berlin, 1998, 374-V428.

    Google Scholar 

  13. A. Finkel and P. Schnoebelen. Fundamental structures in well-structured infinite transition systems, Proc. of Latin American Theoretical INformatics (LATIN), LNCS 1380, Springer-Verlag, Berlin, 1998, 102-118.

    Chapter  Google Scholar 

  14. S. German and A. Sistla. Reasoning about systems with many processes, J. ACM 39, 3 (1992), 675-735.

    Article  MATH  MathSciNet  Google Scholar 

  15. S. Ginsburg. The Mathematical Theory of Context-Free Languages, New York: McGraw-Hill, 1966.

    MATH  Google Scholar 

  16. J. Grabowski. The decidability of persistence for vector addition systems, Inf. Process. Lett. 11, 1 (1980), 20-23.

    Article  MATH  MathSciNet  Google Scholar 

  17. P. Habermehl. On the complexity of the linear time mu-calculus for Petri nets, 18th International Conference on Application and Theory of Petri Nets, LNCS 1248, Springer-Verlag, Berlin, 1997, 102-116.

    Google Scholar 

  18. M. Hack. The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems, FOCS, 1974, 156-164.

    Google Scholar 

  19. M. Hack. The equality problem for vector addition systems is undecidable, C.S.C. Memo 121, Project MAC, MIT, 1975.

    Google Scholar 

  20. M. Hack. Decidability questions for Petri nets, PhD dissertation, Dept. of Elec- trical Engineering, MIT, 1975.

    Google Scholar 

  21. J. Hopcroft and J. Pansiot. On the reachability problem for 5-dimensional vector addition systems, Theoretical Computer Science, 8, 2 (1979), 135-159.

    Article  MATH  MathSciNet  Google Scholar 

  22. R. Howell, D. Huynh, L. Rosier and H. Yen. Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states, Theoretical Computer Science, 46, 2-3 (1986), 107-140.

    Article  MATH  MathSciNet  Google Scholar 

  23. R. Howell, P. Jancar and L. Rosier. Completeness results for single path Petri nets, Information and Computation 106 (1993), 253-265.

    Article  MATH  MathSciNet  Google Scholar 

  24. R. Howell and L. Rosier. Problems concerning fairness and temporal logic for conflict-free Petri nets, Theoretical Computer Science 64, 3 (1989), 305-329.

    Article  MATH  MathSciNet  Google Scholar 

  25. R. Howell, L. Rosier and H. Yen. A taxonomy of fairness and temporal logic problems for Petri nets, Theoretical Computer Science, 82 (1991), 341-372.

    Article  MATH  MathSciNet  Google Scholar 

  26. RHowell, L. Rosier and H. Yen. Normal and sinkless Petri nets, Journal of Computer and System Sciences 46 (1993), 1-26.

    Article  MathSciNet  Google Scholar 

  27. H. Huttel. Undecidable equivalences for basic parallel processes, TACS 94, LNCS 789, Springer-Verlag, Berlin, 1994, 454-464.

    Google Scholar 

  28. D. Huynh. Commutative grammars: the complexity of uniform word problems, Information and Control 57 (1983), 21-39.

    Article  MATH  MathSciNet  Google Scholar 

  29. O. Ibarra. Reversal-bounded multicounter machines and their decision problems, JACM 25, 1 (1978), 116-133.

    Article  MATH  MathSciNet  Google Scholar 

  30. A. Ichikawa and K. Hiraishi. Analysis and control of discrete event systems represented by Petri nets, LNCS 103, Springer-Verlag, 1987, 115-134.

    Google Scholar 

  31. P. Jancar. Decidability of a temporal logic problem for Petri nets, Theoretical Computer Science 74 (1990), 71-93.

    Article  MATH  MathSciNet  Google Scholar 

  32. P. Jancar. Non-primitive recursive complexity and undecidability for Petri net equivalences, Theoretical Computer Science 256 (2001), 23-30.

    Article  MATH  MathSciNet  Google Scholar 

  33. M. Jantzen. Complexity of place/transition nets, Advances in Petri nets 86, LNCS 254, Springer-Verlag, Berlin, 1986, 413-435.

    Google Scholar 

  34. K. Jensen. Coloured Petri Nets and the Invariant-Method, Theor. Comp. Science 14 (1981),317-336.

    Article  MATH  Google Scholar 

  35. N. Jones, L. Landweber and Y. Lien. Complexity of some problems in Petri nets, Theoretical Computer Science 4:277-299, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  36. R. Karp and R. Miller. Parallel program schemata, Journal of Computer and System Sciences 3 (1969), 167-195.

    MathSciNet  Google Scholar 

  37. R. Keller. Vector replacement systems: a formalism for modelling asynchronous systems, Tech. Rept. 117, Computer Science Lab., Princeton Univ. 1972.

    Google Scholar 

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

    Google Scholar 

  39. L. Landweber and E. Robertson. Properties of conflict-free and persistent Petri nets, JACM 25, 3 (1978), 352-364.

    Article  MATH  MathSciNet  Google Scholar 

  40. R. Lipton. The reachability problem requires exponential space, Technical Re- port 62, Yale University, Dept. of CS., Jan. 1976.

    Google Scholar 

  41. E. Mayr. Persistence of vector replacement systems is decidable, Acta Infor- mattica 15 (1981), 309-318.

    Article  MATH  MathSciNet  Google Scholar 

  42. E. Mayr. An algorithm for the general Petri net reachability problem, STOC, 1981,238-246.

    Google Scholar 

  43. E. Mayr. An algorithm for the general Petri net reachability problem, SIAM J. Comput. 13 (1984), 441-460.

    Article  MATH  MathSciNet  Google Scholar 

  44. R. Mayr. Decidability and complexity of model checking problems for infinite- state systems, PhD thesis, Computer Science Dept., TU-Munich, Germany, April 1998.

    Google Scholar 

  45. E. Mayr and A. Meyer. The complexity of the finite containment problem for Petri nets, J. ACM, 28, 3 (1981), 561-576.

    Article  MATH  MathSciNet  Google Scholar 

  46. K. McAloon. Petri nets and large finite sets, Theoretical Computer Science 32 (1984),173-183.

    Article  MATH  MathSciNet  Google Scholar 

  47. P. Merlin. A study of the recoverability of computing systems, PhD thesis, Dept. of Information and COmputer Science, Univ. of California at Irvine, 1974.

    Google Scholar 

  48. H. Muller. Decidability of reachability in persistent vector replacement systems, 9th Symp. on Math. Found. of Computer Science, LNCS 88, Springer-Verlag, Berlin, 1980, 426-438.

    Google Scholar 

  49. T. Murata. Petri nets: properties, analysis and applications, Proc. of the IEEE, 77,4 (1989),541-580.

    Article  Google Scholar 

  50. H. Olsén. 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 

  51. S. Patil. Coordination of asynchronous events, PhD thesis, Dept. of Elec. Eng., MIT, Cambridge, Mass., May. 1970.

    Google Scholar 

  52. Gh. Paun. Computing with membranes, Journal of Computer and System Sciences, 61, 1 (2000), 108-143.

    Article  MATH  MathSciNet  Google Scholar 

  53. J. Peterson. Petri Net Theory and the Modeling of Systems, Prentice Hall, Englewood Cliffs, NJ, 1981.

    Google Scholar 

  54. C. Petri. Kommunikation mit Automaten, Dissertation, Rheinisch-Westfalisches Institut fur. Intrumentelle Mathematik an der Universitat Bonn, Bonn. 1962.

    Google Scholar 

  55. M. Presburger. Uber die Vollstandigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Comptes Rendus du I congres de Mathematiciens des Pays Slaves, Warszawa, 1929,92-101.

    Google Scholar 

  56. C. Rackoff. The covering and boundedness problems for vector addition systems, Theoretical Computer Science 6 (1978), 223-231.

    Article  MATH  MathSciNet  Google Scholar 

  57. C. Ramchandani. Analysis of asynchronous concurrent systems by timed Petri nets, PhD thesis, MIT, Boston, 1974

    Google Scholar 

  58. W. Reisig. Petri Nets: An Introduction, Springer-Verlag New York, Inc., New York, NY, 1985.

    MATH  Google Scholar 

  59. L. Rosier and H. Yen. A multiparameter analysis of the boundedness problem for vector addition systems, Journal of Computer and System Sciences 32, 1 (1986),105-135.

    Article  MATH  MathSciNet  Google Scholar 

  60. G. Sacerdote and R. Tenney. The decidability of the reachability problem for vector addition systems, STOC, 1977, 61-76.

    Google Scholar 

  61. J. van Leeuwen. A partial solution to the reachability problem for vector addition systems, STOC, 1974, 303-309.

    Google Scholar 

  62. H. Yamasaki. Normal Petri nets, Theoretical Computer Science 31 (1984), 307-315.

    Article  MATH  MathSciNet  Google Scholar 

  63. H. Yen. On the regularity of Petri net languages, Information and Computation 124,2 (1996),168-181.

    Article  MathSciNet  Google Scholar 

  64. H. Yen. On reachability equivalence for BPP-nets, Theoretical Computer Science 179 (1997),301-317.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, 652, H-6701, Szeged, Hungary

    Zoltán Esik

  2. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco, 1, 43005, Tarrangona, Spain

    Zoltán Esik

  3. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco, 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  4. Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania

    Victor Mitrana

  5. Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tàrraco, 1, 43005, Tarrangona, Spain

    Victor Mitrana

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2006). Hsu-Chun Yen. In: Esik, Z., Martín-Vide, C., Mitrana, V. (eds) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-33461-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-33461-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33460-6

  • Online ISBN: 978-3-540-33461-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation