ICFPC 1981: Formalization of Programming Concepts pp 471-478 | Cite as

Petri nets and concurrency-like relations

• Authors
• Authors and affiliations

• Piotr Prószyński

Communications

First Online: 24 May 2005

• 80 Downloads

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

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

Preview

Unable to display preview. Download preview PDF.

References

1. [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. [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. [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. [4]
   Janicki R., Atomic Nets, Markings and Concurrency Relations, ICS Reports, to appear.Google Scholar
5. [5]
   Petri C.A., Non-Sequential Processes, ISF Report 70-01, GMD, Bonn, 1977.Google Scholar
6. [6]
   Petri C.A., Concurrency as a Basis of System Thinking, ISF Report 78-06, GMD, Bonn, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

• Piotr Prószyński
  • 1

1. 1.Institute of MathematicsWarsaw Technical UniversityWarszawaPoland