Advertisement

On equivalent execution semantics of concurrent systems

  • Ryszard Janicki
  • Maciej Koutny
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 266)

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.

Keywords

State Machine Step Sequence Execution Model Execution Path Concurrent Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7 References

  1. [BRA 80]
    Breuer W. (ed.), Applications and Theory of Petri Nets, Lecture Notes in Computer Science, vol.80, Springer 1980.Google Scholar
  2. [ELR 82]
    Elrad T., Francez N., Decomposition of Distributed Programs into Communication-Closed Layers, Science of Programming 2, 1982, pp.155–173.Google Scholar
  3. [HOA 80]
    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.Google Scholar
  4. [JAN 83]
    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.Google Scholar
  5. [JAN 86a]
    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.Google Scholar
  6. [JAN 86b]
    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.Google Scholar
  7. [JEN 83]
    Jensen K., et al., Petri Net Package. User's Manual, Raport DAIMI MD-46, Computer Science Dept., Aarhus University, 1983.Google Scholar
  8. [LAU 81]
    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.Google Scholar
  9. [LAU 83]
    Lauer P. E., User's Introduction to BCS, Report ASM/107, Computing Laboratory, University of Newcastle upon Tyne, 1983.Google Scholar
  10. [MAZ 77]
    Mazurkiewicz A., Concurrent Program Schemes and Their Interpretations, Report DAIMI PB-78, Dept. of Computer Science, Aarhus Univ. Publ., 1977.Google Scholar
  11. [MIL 80]
    Milner R., A Calculus of Communicating Systems, Lecture Notes in Computer Science, vol. 92, Springer 1980.Google Scholar
  12. [MON 83]
    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.Google Scholar
  13. [NIV 82]
    Nivat M., Behaviours of Processes and Synchronised Systems, In: M.Broy, G.Schmidt (eds.): “Theoretical Foundations of Programming Concepts”, D. Reidel Publ. Co., 1982.Google Scholar
  14. [PET 81]
    Peterson J.L., Petri Net Theory and the Modeling of Systems, Prentice Hall, 1981.Google Scholar
  15. [REI 84]
    Reisig W., On the Semantics of Petri Nets, Internal Report No II HH 100, Dept. of Comp. Sci., Hamburg University, 1984.Google Scholar
  16. [ROZ 83]
    Rozenberg G., Verraedt R., Subset Languages of Petri Nets, Informatik-Fachberichte, vol. 66, Springer 1983, pp. 250–263.Google Scholar
  17. [SAL 81]
    Salwicki A. and Müldner T., On algorithmic Properties of Concurrent Programs, Lecture Notes in Computer Science, vol. 125, Springer 1981, pp. 169–197.Google Scholar
  18. [SHI 79]
    Shields M.W., Adequate Path Expressions, Lecture Notes in Computer Science, vol. 70, Springer 1979, pp. 249–265.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Ryszard Janicki
    • 1
  • Maciej Koutny
    • 2
  1. 1.Department of Computer Science and SystemsMcMaster UniversityHamiltonCanada
  2. 2.Computing LaboratoryThe University of Newcastle upon TyneNewcastle upon TyneU.K.

Personalised recommendations