Skip to main content
SpringerLink
Log in

Nets Consisting of Places and Transistions

  • Chapter
Book cover Petri Nets

Part of the book series: EATCS Monographs on Theoretical Computer Science ((EATCS,volume 4))

Abstract

As a first example in this chapter we consider a system consisting of one producer and two consumers. We have already seen this in Fig. 5. In this modified version

  1. (1)

    the buffer may contain at most five tokens,

  2. (2)

    the producer generates three tokens in each step,

  3. (3)

    at most one consumer is able to access the buffer in each configuration of the system,

  4. (4)

    each consumer removes two tokens when accessing the buffer,

  5. (5)

    the production steps of the producer are counted.

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

(a) Coverability Graphs

  1. R. M. Karp, R. E. Miller: Parallel Program Schemata. Journal of Computer and System Sciences 3 (1969), pp. 147–195.

    Article  MathSciNet  MATH  Google Scholar 

  2. M. Jantzen, R. Valk: Formal Properties of Place/Transition Nets, W. Brauer (ed.): Net Theory and Applications. Springer Lecture Notes in Computer Science, 84 (1980).

    Google Scholar 

(b) Liveness

  1. K Lautenbach: Liveness in Petri Nets. Internal Report GMD-ISF 72–02.1 (1972).

    Google Scholar 

  2. M. Hack: The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems. Proceedings of the 15th Annual Symposium on Switching and Automata Theory, New York IEEE (1974)

    Google Scholar 

  3. K. Gostelow: Computation Modules and Petri Nets. Third IEEE-ACM Milwaukee Symposium on Automatic Computation and Control, New York (1975)

    Google Scholar 

  4. H. Schmid, E. Best: Towards a Constructive Solution of the Liveness Problem in Petri Nets. Technical Report 4/76, Institut für Informatik, Universität Stuttgart, West Germany (1976)

    Google Scholar 

  5. Y. Lien: Termination Properties of Generalized Petri Nets. SIAM Journal of Computing 5, Nr. 2 (1976), pp. 251–265.

    Article  MathSciNet  MATH  Google Scholar 

References to Chapter 5 (c) Further Properties

  1. L. Landweber, E. Robertson: Properties of Conflict-Free and Persistent Petri Nets. Journal of the ACM, Vol. 25, Nr. 3 (1978), pp. 352–364

    Article  MathSciNet  MATH  Google Scholar 

  2. J. H. Müller: Decidability of Reachability in Persistent Vector Replacement Systems. 9th Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science Vol. 88, Springer-Verlag (1980), pp. 426–438

    Google Scholar 

  3. E. Mayr: Persistence of Vector Replacement Systems is Decidable. Acta Informatica 15 (1981), pp. 309–318

    Article  MathSciNet  MATH  Google Scholar 

  4. H. Yomoasaki: On Weak Persistency of Petri Nets. Information Processing Letters 13, 3 (1981), pp. 94–97.

    Article  MathSciNet  Google Scholar 

  5. J. R. Jump, P. S. Thiagarajan: On the Equivalence of Asynchronous Control Structures. 13th Annual Switching and Automata Theory Symposium (Oct. 1972), 212–223. Also: SIAM Journal of Computing, Vol. 2, No. 2 (June 1973), pp. 67–87

    Google Scholar 

  6. G André: Use of Behaviour Equivalence in Place/Transition Net Analysis, C. Girault, W. Reisig (eds.): Application and Theory of Petri Nets. Informatik Fachbericht 52, Springer Publishing Company (1982).

    Google Scholar 

  7. C. André: Structural Transformations giving B-equivaient PT-Nets, A Pagnoni, G. Rozenberg (eds.): Application and Theory of Petri Nets. Informatik Fachberichte 66, Springer Publishing Company (1983).

    Google Scholar 

  8. F. De Cindio, G. De Michelis, L. Pomello, C. Simone: Equivalence Notions for Concurrent Systems, A Pagnoni, G. Rozenberg (eds.): Application and Theory of Petri Nets. Informatik Fachberichte 66, Springer Publishing Company (1983).

    Google Scholar 

  9. M Yoeli, T. Etzion: Behavioural Equivalence of Concurrent Systems, A Pagnoni, G. Rozenberg (eds.): Application and Theory of Petri Nets. Informatik Fachberichte 66, Springer Publishing Company (1983).

    Google Scholar 

(d) Analysis Methods

  1. G. Berthelot, G. Roucairol, R. Valk: Reduction of Nets and Parallel Programs, in W. Brauer (ed.): Net Theory and Applications. Springer Lecture Notes in Computer Science, 84 (1980).

    Google Scholar 

  2. J. R. Valette: Analysis of Petri Nets by Stepwise Refinements. Journal of Computer and System Sciences 18, No. 1 (1979), pp. 35–46

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Toulotte, J. P. Parsy: A Method for Decomposing Interpreted Petri Nets and its Utilization. Digital Processes 5 (1979), pp. 223–234

    MATH  Google Scholar 

  4. I. Suzuki, T. Murata: A Method for Hierarchically Representing Large Scale Petri Nets. Proceedings of the 1980 International Conference on Circuits and Computer, October 1980

    Google Scholar 

  5. M. Silva: Simplification des Rèseaux de Petri par elimination des places implicites. Digital Processes 6 (1980), pp. 245–256.

    MathSciNet  MATH  Google Scholar 

(e) The Reachability Problem

  1. S. R. Kosaraju: Decidability of Reachability in Vector Addition Systems. Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, San Francisco, California, May 5–7, 1982, pp. 267–281.

    Google Scholar 

  2. H. J. Müller: Filling a Gap in Kosaraju’s Proof for the Decidability of the Reachability Problem in VAS. Newsletter of the Special Interest Group “Petri Nets and Related System Models”, No. 12, October 1982 (cf. [26]).

    Google Scholar 

  3. J. van Leeuwen: A Partial Solution to the Reachability Problem for Vector-Addition Systems. Proc. of the sixth Annual ACM Symposium on Theory of Computing (1974), pp. 303–307.

    Google Scholar 

  4. G. S. Sacerdote, R. L. Tenney: The Decidability of the Reachability Problem for Vector Addition Systems. Proc. of the ninth Annual ACM Symposium on Theory of Computing (1977), pp. 61–76.

    Google Scholar 

  5. J. Hopcroft, J. J. Pansiot: On the Reachability Problem of five dimensional Vector Addition Systems. Theoretical Computer Science 8 (1979), pp. 135–159.

    Article  MathSciNet  MATH  Google Scholar 

  6. E. W. Mayr: An Algorithm for the General Petri Net Reachability Problem. Proc. of the 13th Annual ACM Symposium on Theory of Computing (1981), pp. 238–246.

    Google Scholar 

(f) Decidability and Complexity

  1. M. Jantzen: Komplexität von Petrinetz-Algorithmen. Unpublished course material, University of Hamburg (1984).

    Google Scholar 

  2. H. Baker: Rabin’s Proof of the Undecidability of the Reachability Set Inclusion Problem for Vector Addition Systems. Computation Structures Group Memo 79, Project MAC, MIT Cambridge, Massachusetts (July 1973)

    Google Scholar 

  3. M. Hack: Decidability Question for Petri Nets. Ph. D. thesis, Department of Electrical Engineering, MIT (December 1974). Also: Technical Report 161, Laboratory for Computer Science, MIT, Cambridge, Massachusetts (June 1976)

    Google Scholar 

  4. M. Hack: The Equality Problem for Vector Addition Systems is Undecidable. Theoretical Computer Science 2 (1976), pp. 77–95

    Article  MathSciNet  MATH  Google Scholar 

  5. T. Araki, T. Kasami: Some Decision Problems Related to the Reachability Problem for Petri Nets. Theoretical Computer Science 3 (1977), pp. 85–104

    Article  MathSciNet  MATH  Google Scholar 

  6. T. Araki, T. Kasami: Decidable Problems on the Strong Connectivity of Petri Net Reachability Sets. Theoretical Computer Science 4 (1977), pp. 99–119

    Article  MathSciNet  MATH  Google Scholar 

  7. N. Jones, L. Landweber, Y. E. Lien: Complexity of Some Problems in Petri Nets. Theoretical Computer Science 4 (1977), pp. 277–299

    Article  MathSciNet  MATH  Google Scholar 

  8. C. Rackoff: The Covering and Boundedness Problem for Vector Addition Systems. Theoretical Computer Science 6 (1978), pp. 223–231

    Article  MathSciNet  MATH  Google Scholar 

  9. E. W. Mayr: The Complexity of the Finite Containment Problem for Petri Nets. Cambridge, Mass., MIT Lab. for Computer Science, Technical Report 181 (1977)

    Google Scholar 

  10. E. W. Mayr, A. R. Meyer: The Complexity of the Finite Containment Problem for Petri Nets. Journal of the ACM 28, 3 (1981), pp. 561–576

    Article  MathSciNet  MATH  Google Scholar 

  11. M Jantzen, H. Bramhoff: Notions of Computability by Petri Nets, A Pagnoni, G. Rozenberg (eds.): Application and Theory of Petri Nets. Informatik Fachberichte 66, Springer Publishing Company (1983).

    Google Scholar 

(g) Petri Net Languages

  1. M Hack: Petri Net Languages. Computation Structures Group Memo 124, Project MAC, MIT (1975). Also: Technical Report 159, Laboratory for Computer Science MIT Cambridge, Massachusetts (1976)

    Google Scholar 

  2. J. L. Peterson: Computation Sequence Sets. Journal of Computer and System Sciences 13, 1(1976), pp. 1–24

    Article  MathSciNet  MATH  Google Scholar 

  3. R. Valk, G. Vidal-Naquet: Petri Nets and Regular Languages. Journal of Computer and System Sciences 23 (1981), pp. 229–325

    Article  MathSciNet  Google Scholar 

  4. S. Crespi-Reghizzi, D. Mandrioli: Petri Nets and Szilard Languages. Information and Control 33, No. 2 (1977), pp. 177–192

    Article  MathSciNet  MATH  Google Scholar 

  5. J. Grabowski: The Unsolvability of Some Petri Net Language Problems. Information Processing Letters 9, No. 2 (1979), pp. 60–63

    Article  MathSciNet  MATH  Google Scholar 

  6. D. Mandrioli: A Note on Petri Net Languages. Information and Control 34, No. 2 (1977), pp. 169–171

    Article  MathSciNet  MATH  Google Scholar 

  7. P. Starke: Free Petri Net Languages. Seventh Symposium on Mathematical Foundations of Computer Science 1978, Lecture Notes in Computer Science 64, Springer-Verlag (1978), pp. 506–515

    Google Scholar 

  8. Matthias Jantzen: On the Hierarchy of Petri Net Languages. R.A.I.R.O. Informatique théoretique/Theoretical Informatics Vol. 19, No. 1 (1979), pp. 19–30

    MathSciNet  Google Scholar 

  9. T. Araki, T. Kagimasa, N. Tokura: Relations of Flow Languages to Petri Net Languages. Theoretical Computer Science 15 (1981), pp. 51–75.

    Article  MathSciNet  MATH  Google Scholar 

(h) Behaviour Representation

  1. P. Starke: Processes in Petri Nets. Elektronische Informationsverarbeitung und Kybernetik, EIK 17 8/9 (1981), pp. 389–416

    MathSciNet  MATH  Google Scholar 

  2. G. Rozenberg, R. Verraedt: Subset Languages for Petri Nets. Part I: The Relationship to String Languages and Normal Forms. Theoretical Computer Science (1983), Vol. 26, pp. 301–326

    Article  MathSciNet  MATH  Google Scholar 

  3. G. Rozenberg, R. Verraedt: Subset Languages for Petri Nets. Part II: Closure Properties. Theoretical Computer Science (1983), Vol. 27, pp. 85–108

    Article  MathSciNet  MATH  Google Scholar 

  4. H. D. Burkhard: Ordered Firing in Petri Nets. Elektronische Informationsverarbeitung und Kybernetik (EIK) 2/3 (1983), pp. 71–86.

    MathSciNet  Google Scholar 

  5. U. Goltz, W. Reisig: The Non-sequential Behaviour of Petri Nets. Information & Control, Vol. 57, Nos. 2–3 (1983), pp. 125–147.

    Article  MathSciNet  MATH  Google Scholar 

  6. R. Valk: Infinite Behaviour of Petri Nets. Theoretical Computer Science 25, (3) (1983), pp. 342–373.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Postfach 12 40, Schloß Birlinghoven 5205 St., Augustin 1, Germany

    Dr. Wolfgang Reisig GMD

Authors
  1. Dr. Wolfgang Reisig GMD
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Reisig, W. (1985). Nets Consisting of Places and Transistions. In: Petri Nets. EATCS Monographs on Theoretical Computer Science, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69968-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69968-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-69970-2

  • Online ISBN: 978-3-642-69968-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation