Skip to main content

Petri nets and concurrency-like relations

  • Communications
  • Conference paper
  • First Online:
Formalization of Programming Concepts (ICFPC 1981)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Best E., A Theorem on the Characteristic of Non-Sequential Processes, Technical Report 116, Univ. of Newcastle upon Tyne, Comp. Labor., 1977.

    Google Scholar 

  2. Janicki R., A Characterization of Concurrency-like Relations, Lecture Notes in Comp. Sci., vol. 70, Springer-Verlag, 1979, pp. 109–122.

    Google Scholar 

  3. Janicki R., On Atomic Nets and Concurrency Relations, Lecture Notes in Comp. Sci., vol. 88, Springer-Verlag, 1980, pp. 320–333.

    Google Scholar 

  4. Janicki R., Atomic Nets, Markings and Concurrency Relations, ICS Reports, to appear.

    Google Scholar 

  5. Petri C.A., Non-Sequential Processes, ISF Report 70-01, GMD, Bonn, 1977.

    Google Scholar 

  6. Petri C.A., Concurrency as a Basis of System Thinking, ISF Report 78-06, GMD, Bonn, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. Díaz I. Ramos

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prószyński, P. (1981). Petri nets and concurrency-like relations. In: Díaz, J., Ramos, I. (eds) Formalization of Programming Concepts. ICFPC 1981. Lecture Notes in Computer Science, vol 107. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10699-5_120

Download citation

  • DOI: https://doi.org/10.1007/3-540-10699-5_120

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10699-9

  • Online ISBN: 978-3-540-38654-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics