Abstract
We have attempted to present a formalization of decomposition of nets into indivisible sequential components and to investigate different notions of concurrency. We feel that this paper presents a sound foundations for studying the concurrency relation in the case of the whole class of condition/event nets. All proofs will be published soon.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Janicki R., A Characterization of Concurrency-like Relations, Lecture Notes in Comp. Sci., vol. 70, Springer-Verlag, 1979, pp. 109–122.
Janicki R., Synthesis of Concurrent Schemes, Lecture Notes in Comp. Sci., vol. 64, Springer-Verlag, 1978, pp. 298–307.
Janicki R., An Algebraic Structure of Petri Nets, Proc. of the 4th International Conference on Theory and Practice of Programming, Paris, 1980.
Mazurkiewicz A., Concurrent Program Schemes and Their Interpretations, DAIMI PB-78, Aarhus Univ. Publ., 1977.
Petri C.A., Non-sequential Processes, ISF Report 70-01, GMD, Bonn, 1977.
Petri C.A., Concurrency as a Basis of System Thinking, ISF Report 78-06, GMD Bonn, 1978.
Shields M.W., Adequate Path Expressions, Lecture Notes in Comp. Sci., vol. 70, Springer-Verlag, 1979, pp. 249–265.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janicki, R. (1980). On atomic nets and concurrency relations. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022514
Download citation
DOI: https://doi.org/10.1007/BFb0022514
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive