Abstract
Various execution semantics of concurrent systems are formally defined and investigated. The problem of the existence of minimal execution semantics equivalent to the semantics expressed intuitively as “execute as possible” is studied. The positive answer to that problem is given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7 References
Breuer W. (ed.), Applications and Theory of Petri Nets, Lecture Notes in Computer Science, vol.80, Springer 1980.
Elrad T., Francez N., Decomposition of Distributed Programs into Communication-Closed Layers, Science of Programming 2, 1982, pp.155–173.
Hoare C.A.R., Communicating Sequential Processes, In: McKeag R.H. and Macnaghten A.M. (eds.), On the Construction of Programs, Cambridge Univ. Press, Cambridge-New-York, 1980, pp. 229–254.
Janicki R., Lauer P.E., Devillers R., Maximally Concurrent Evolution of Non-Sequential Systems, Proc. of the 4th European Workshop on Applications and Theory of Petri Nets, Toulouse, 1983, pp. 188–202.
Janicki R., A Formal Semantics for Concurrent Systems with a Priority Relation (Revised Version), Report R 86-1, Institute of Electronic Systems, Aalborg University, 1986.
Janicki R., Lauer P.E., Koutny M., Devillers R., Concurrent and Maximally Concurrent Evolution of Non-Sequential Systems, Theoretical Computer Science 43(1986), pp.213–238.
Jensen K., et al., Petri Net Package. User's Manual, Raport DAIMI MD-46, Computer Science Dept., Aarhus University, 1983.
Lauer P.E., Shields M.W., Cotronis J.Y., Formal Behavioural Specification of Concurrent Systems without Globality Assumptions, Lecture Notes in Computer Science, vol. 107, Springer 1981, pp. 115–151.
Lauer P. E., User's Introduction to BCS, Report ASM/107, Computing Laboratory, University of Newcastle upon Tyne, 1983.
Mazurkiewicz A., Concurrent Program Schemes and Their Interpretations, Report DAIMI PB-78, Dept. of Computer Science, Aarhus Univ. Publ., 1977.
Milner R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer 1980.
Montel B. et al., OVIDE, A software Package for the Validation of Systems Represented by Petri Net Based Models, Proceedings of the 4th European Workshop on Application and Theory of Petri Nets, Toulouse, France, 1983, pp. 292–308.
Nivat M., Behaviours of Processes and Synchronised Systems, In: M.Broy, G.Schmidt (eds.): “Theoretical Foundations of Programming Concepts”, D. Reidel Publ. Co., 1982.
Peterson J.L., Petri Net Theory and the Modeling of Systems, Prentice Hall, 1981.
Reisig W., On the Semantics of Petri Nets, Internal Report No II HH 100, Dept. of Comp. Sci., Hamburg University, 1984.
Rozenberg G., Verraedt R., Subset Languages of Petri Nets, Informatik-Fachberichte, vol. 66, Springer 1983, pp. 250–263.
Salwicki A. and Müldner T., On algorithmic Properties of Concurrent Programs, Lecture Notes in Computer Science, vol. 125, Springer 1981, pp. 169–197.
Shields M.W., Adequate Path Expressions, Lecture Notes in Computer Science, vol. 70, Springer 1979, pp. 249–265.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janicki, R., Koutny, M. (1987). On equivalent execution semantics of concurrent systems. In: Rozenberg, G. (eds) Advances in Petri Nets 1987. APN 1986. Lecture Notes in Computer Science, vol 266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18086-9_21
Download citation
DOI: https://doi.org/10.1007/3-540-18086-9_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18086-9
Online ISBN: 978-3-540-47743-3
eBook Packages: Springer Book Archive