Skip to main content
SpringerLink
Log in

Petri Nets and their Application an Introduction

  • Chapter
Management and Office Information Systems

Abstract

A graph model now known as Petri nets originated in C. A. Petri’s doctoral dissertation (1) in 1962 at the University of Bonn, West Germany. In the mid 1960s, Petri’s work was introduced in the United States, and during the 1970s it spread over many parts of the world. At the time of this writing, the Europeans are most active in research and conferences on Petri nets: they have held a two-week advanced course on this subject in Hamburg, West Germany under the direction of Dr. Petri in 1979(2); and held so far three workshops on applications and theory of Petri nets, one each in France (1980), West Germany (1981), and Italy (1982).(3) In this field two books, one in English(4) and the other in German,(5) are now available, and several tutorial articles(6–10) have been written. A comprehensive bibliography(11) is also available and is updated periodically.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References and Notes

  1. C. A. Petri, Kommunikation mit Automaten, Univ. of Bonn, 1962; English translation by C. F. Greene, Jr. Communication with Automata, Supplement 1 to Tech. Report RADC-TR-65- 377, Vol. 1 Rome Air Development Center, Griffiss Air Force Base, Rome, N.Y. 1965.

    Google Scholar 

  2. W. Brauer (Ed.), Net Theory and Applications, Lecture Notes in Computer Science, Vol. 84, Springer-Verlag, Berlin, 1980.

    Google Scholar 

  3. C. GIrault and W. Reisig (Eds.), Applications and Theory of Petri Nets, Informatik-Fach- berichte, No. 52, Springer-Verlag, Berlin, 1982.

    Google Scholar 

  4. J. L. Peterson, Petri Net Theory and the Modeling of Systems, Prentice-Hall, Englewood Cliffs, New Jersey, 1981.

    Google Scholar 

  5. W. Reisig, Petrinetze: Eine Einfuhrung, Mit 111 Abbildungen, Springer-Verlag, Berlin, 1982.

    Google Scholar 

  6. T. Murata, Petri nets, marked graphs, and circuit-system theory—A recent CAS application, Circuits Syst. 11 (3), 2–12 (1977).

    MathSciNet  Google Scholar 

  7. J. L. Peterson, Petri nets, Computing Surv. 9, 223–252 (1977).

    Article  MATH  Google Scholar 

  8. T. Agerwala, Putting Petri nets to work, Computer 12 (12), 85–94 (1979).

    Article  Google Scholar 

  9. T. Agerwala, Putting Petri nets to work, Computer 12 (12), 85–94 (1979).

    Article  Google Scholar 

  10. R. Johnsonbaugh and T. Murata, Petri nets and marked graphs—Mathematical models of concurrent computation, Am. Math Mon. 107, October (1982); this is an updated version of Ref. 6, pp. 552-566.

    Google Scholar 

  11. E. Pless and H. Plunnecke, A bibliography of net theory, ISF-Report 80.05, Second Ed., August 1980, GMD, St. Augustin 1, West Germany.

    Google Scholar 

  12. T. MURATA, State equation, controllability, and maximal matchings of Petri Nets, IEEE Trans. Autom. Control AC-22(3), 412–416 (1977).

    Google Scholar 

  13. G. MEMMI and G. ROUCAIROL, Linear algebra in net theory, pp. 213-224 in Brauer, Ref. 2, above.

    Google Scholar 

  14. F. COMMONER, A. W. HOLT, S. EVEN, and A. PNULI, Marked directed graphs, J. Comput. Syst. Sci. 5, 511–523 (1971).

    Article  MATH  Google Scholar 

  15. T. MURATA, Circuit theoretic analysis and synthesis of marked graphs, IEEE Trans. Circuits Syst. CAS-24(7), 400–405 (1977).

    Google Scholar 

  16. T. MURATA, Synthesis of decision-free concurrent systems for prescribed resources and perfor¬mance, IEEE Trans. Software Eng. SE-6(6), 525–530 (1980).

    Google Scholar 

  17. C. V. RAMAMOORTHY and H. H. SO, Software requirements and specifications: Status and per¬spectives, in Tutorial: Software Methodology, IEEE Catalog No. EHO 142-0, pp. 43-164, 1978.

    Google Scholar 

  18. L. J. MEKLY and S. S. YAU, Software design representation using abstract process networks, IEEE Trans. Software Eng. SE-6(5), 420–435 (1980).

    Google Scholar 

  19. J. R. JUMP, Asynchronous control arrays, IEEE Trans Comput. C-23(10), 1020–1029 (1974).

    Google Scholar 

  20. S. S. PATIL, Micro-control for parallel asynchronous computers, Euromicro Workshop, Nice, June 1975. Also, Comp. Struct. Group Memo #120, Project MAC, MIT, March 1975.

    Google Scholar 

  21. J. D. NOE and G. J. NUTT, Macro E-nets for representations of parallel systesm, IEEE Trans. Comput. C-22(8), 718–727 (1973).

    Google Scholar 

  22. R. M. SHAPIRO and H. SAINT, A new approach to optimization of sequencing decisions, Ann. Rev. Automatic Programming 6 (5), 257–288 (1970).

    Article  Google Scholar 

  23. J. L. BAER and C. S. ELLIS, Model, design, and evaluation of a compiler for a parallel processing environment, IEEE Trans. Software Eng. SE-3(6), 394–405 (1977).

    Google Scholar 

  24. J. A. MELDMAN and A. W. HOLT, Petri nets and legal systems, Jurimetrics J. 12 (2), 66–75 (1971).

    Google Scholar 

  25. C. A. ELLIS and G. J. NUTT Office information systems and computer science, Comput. Surv. 12(1), 27-60, March, 1980.

    Google Scholar 

  26. M. HACK, Petri net languages, Report TR-159, MIT, Lab. for Computer Sci., March 1976.

    Google Scholar 

  27. J. L. PETERSON, Computation sequence sets, J. Comput. Syst. Sci. 13 (1), 1–24 (1976).

    Article  MATH  Google Scholar 

  28. H. J. GENRICH, The Petri net representation of mathematical knowledge, Report ISF-76-05, GMD, Bonn, 1976.

    Google Scholar 

  29. P. M. MERLIN and D. J. FARBER, Recoverability of communication protocols: Implications of a theoretical study, IEEE Trans. Commun. COM-24(9), 1036–1043 (1976).

    Google Scholar 

  30. The 2nd European Workshop on Petri nets devoted itself to Petri net modeling of communication protocols and its proceedings, Ref. 3, contains many papers on this subject.

    Google Scholar 

  31. C. ANDRE, M. DIAZ, C. GIRAULT, and J. SITAKIS, Survey of French research and applications based on Petri nets, in Net Theory and Applications, Lecture Notes in Computer. Sci., Vol. 84, W. Brauer, Ed., pp. 321–346, Springer-Verlag, Berlin, 1980.

    Google Scholar 

  32. J. SIFAKIS, Use of Petri nets for performance evaluation, Measuring, Modelling and Evaluation Computer Systems, Beilner and Gelenebe, Eds., pp. 75-93, North-Holland, Amsterdam, 1977.

    Google Scholar 

  33. J. SIFAKIS, Realization of fault-tolerant systems by coding Petri nets, J. Design Automation Fault-Tolerant Comput IV (1), 93–107 (1979).

    MathSciNet  Google Scholar 

  34. A. C. PAGNONI, A fair competition between two or more partners, CP Project Report, Inst, of Cibernetica, Univ. of Milano, Feb. 1981; also in Ref. 3.

    Google Scholar 

  35. W. E. KLUGE and K. LAUTENBACH, The orderly resolution of memory access conflicts, IEEE Trans. Comput. C-31(3), 194–207 (1982).

    Google Scholar 

  36. T. MURATA, V. B. LE, and D. J. LEU, A method for realizing the synchronic distance matrix as a marked graph, Procs. of the 1982 IEEE International Symposium on Circuits and Systems, Rome, Italy, May 1982, pp. 609–612.

    Google Scholar 

  37. H. J. GEnrich, K. Lautenbach, and P. S. Thiagarajan, Elements of general net theory, in W. Brauer, Ed., Net Theory and Applications, Lecture Notes in Comp. Sci., Vol. 84, pp. 21- 164, Springer-Verlag, Berlin, 1980.

    Google Scholar 

  38. K. Jensen, Coloured Petri nets and the invariant method, Theor. Comput. Sci. 14, 317–336 (1981).

    MATH  Google Scholar 

  39. K. Voss, Using predicate/transition nets to model and analyze distributed database systems, IEEE Trans. Software Eng. SE-6(6), 539–544 (1980).

    Google Scholar 

  40. M. Jantzen and R. Volk, Formal properties of place/transition nets, in W. Brauer, Ed., Net Theory and Applications, Ref. 2.

    Google Scholar 

  41. I. Suzuki and T. Murata, A method for stepwise refinement and abstraction of Petri nets, J. Comput. Syst. Sci. 27 (1), 51-76, August, 1983. An earlier version, A method for hierarchically representing large scale Petri nets, was published in the Proc. of the IEEE International Conf. on Circuits and Computers, pp. 620–623, October 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering and Computer Science, University of Illinois at Chicago, Box 4348, Chicago, Illinois, USA

    Tadao Murata

Authors
  1. Tadao Murata
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Illinois Institute of Technology, Chicago, Illinois, USA

    Shi-Kou Chang

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Plenum Press, New York

About this chapter

Cite this chapter

Murata, T. (1984). Petri Nets and their Application an Introduction. In: Chang, SK. (eds) Management and Office Information Systems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-2677-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-2677-9_20

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-9666-9

  • Online ISBN: 978-1-4613-2677-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation