Advertisement

Acta Informatica

, Volume 31, Issue 1, pp 81–104 | Cite as

The connection between an event structure semantics and an operational semantics forTCSP

  • Christel Baier
  • Mila E. Majster-Cederbaum
Article

Abstract

The relation between an operational interleaving semantics forTSCP based on a transition system and a compositional true concurrency semantics based on event structures is studied. In particular we extend the consistency result of Goltz and Loogan [15] forTCSP processes without recursion to the general case. Thus we obtain for everyTCSP processP that its operational meaningO(P) and the interleaving behaviourO( M∥3P∥3) which is derived from the event structureM∥3P∥3 associated withP are bisimilar.

Keywords

Information System Operating System Data Structure Communication Network Information Theory 
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.

References

  1. 1.
    Bakker, J.W. de, Zucker, J.I.: Processes and the denotational semantics of concurrency. Inf. Control54, 70–120 (1982)Google Scholar
  2. 2.
    Bakker, J.W. de, Warmerdam, J.H.A.: Metric pomset semantics for a concurrent language with recursion. Report CS-R9033, Centre for Mathematics and Computer Science, Amsterdam, July 1990Google Scholar
  3. 3.
    Bakker, J.W. de, Warmerdam, J.H.A.: Four domains for concurrency. Theor. Comput. Sci.90, 127–149 (1991)Google Scholar
  4. 4.
    Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Inf. Control60, 109–137 (1984)Google Scholar
  5. 5.
    Boudol, G., Castellani, I.: On the semantics of concurrency: partial orders and transition systems. Proc. TAPSOFT 87, vol. 1 (Lect. Notes Comput. Sci., vol. 249, pp. 123–137) Berlin, Heidelberg, New York: Springer 1987Google Scholar
  6. 6.
    Boudol, G., Castellani, I.: Permutation of transitions: An event structure semantics forCCS andSCCS. Proc. School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency (Lect. Notes Comput. Sci. vol. 354, pp. 411–427) Berlin, Heidelberg, New York: Springer 1989Google Scholar
  7. 7.
    Boudol, G., Castellani, I.: Three equivalent semantics forCCS. (Lect. Notes Comput. Sci., vol. 469) Berlin, Heidelberg, New York: Springer 1990Google Scholar
  8. 8.
    Brookes, S.D.: A model for communicating sequential processes. Report CMU-CS 83-149, Carnegie-Mellon University, January 1983Google Scholar
  9. 9.
    Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. J. ACM31, 560–599 (1984)Google Scholar
  10. 10.
    Brookes, S.D., Roscoe, A.W.: An improved failure model for communicating processes. Seminar on Concurrency (Lect. Notes Comput. Sci., vol. 197) Berlin, Heidelberg, New York: Springer 1985Google Scholar
  11. 11.
    Curry, H.B., Feys, R.: Combinatory logic. Amsterdam: North-Holland 1968Google Scholar
  12. 12.
    Degano, P., De Nicola, R., Montanari, U.: A distributed operational semantics forCCS based on condition/event systems. Acta Inf.26, 59–91 (1988)Google Scholar
  13. 13.
    Degano, P., De Nicola, R., Montanari, U.: On the consistency of 'truly concurrent' operational and denotational semantics. Proc. Symposium on Logic in Computer Science, Edinburgh, pp. 133–141, 1988Google Scholar
  14. 14.
    Goltz, U.: On representingCCS programs as finite Petri nets. Proc. MFCS 88 (Lect. Notes Comput. Sci., vol. 324, pp. 339–350) Berlin, Heidelberg, New York: Springer 1988Google Scholar
  15. 15.
    Goltz, U., Loogen, R.: Modelling nondeterministic concurrent processes with event structures. Fundam. Inf.14, 39–73 (1991)Google Scholar
  16. 16.
    Goltz, U., Mycroft, A.: On the relationship ofCCS and Petri nets. Proc. ICALP 84 (Lect. Notes Comput. Sci., vol. 172) Berlin, Heidelberg, New York: Springer 1984Google Scholar
  17. 17.
    Hoare, C.A.R.: Communicating sequential processes, Englewood Cliffs, NJ: Prentice Hall 1985Google Scholar
  18. 18.
    Milner, R.: A calculus of communicating systems. (Lect. Notes Comput. Sci., vol 92) Berlin, Heidelberg, New York: Springer 1980Google Scholar
  19. 19.
    Milner, R.: Lectures on a calculus of communicating systems. Seminar on Concurrency (Lect. Notes Comput. Sci., vol. 197) Berlin, Heidelberg, New York: Springer 1985Google Scholar
  20. 20.
    Nielsen, M., Plotkin, G., Winskel, G.: Petri-nets, event structures and domains. Theor. Comput. Sci.13, 85–108 (1981).Google Scholar
  21. 21.
    Olderog, E.R.:TCSP: theory of communicating sequential processes. Advances in Petri-nets 1986 (Lect. Notes Comput. Sci., vol. 255, pp. 441–465) Berlin, Heidelberg, New York: Springer 1987Google Scholar
  22. 22.
    Olderog, E.R.: Operational Petri-net semantics forCCSP. Advances in Petri-nets 1987 (Lect. Notes Comput. Sci., vol. 266. pp. 196–223) Berlin, Heidelberg, New York: Springer 1987Google Scholar
  23. 23.
    Olderog, E.R., Hoare, C.A.R.: Specification-oriented semantics for communicating processes. Acta Inf.23, 9–66 (1986)Google Scholar
  24. 24.
    Plotkin, G.D.: An operational semantics forCSP. In: Bjorner, D. (ed.), Formal description of programming concepts II, pp. 199–225. Amsterdam: North Holland 1983Google Scholar
  25. 25.
    Reisig, W.: Partial order semantics versus interleaving semantics forCSP-like languages and its impact on fairness. Proc. ICALP 84 (Lect. Notes Comput. Sci., vol. 172, pp. 403–413) Berlin, Heidelberg, New York: Springer 1984Google Scholar
  26. 26.
    Taubner, D., Vogler, W.: The step failure semantics. Proc. STACS 87 (Lect. Notes Comput. Sci., vol. 247, pp. 348–359) Berlin, Heidelberg, New York: Springer 1987Google Scholar
  27. 27.
    Vaandrager, F.W.: A simple definition for parallel composition of prime event structures. Techn. Report CS-R 8903, CWI Amsterdam, 1989Google Scholar
  28. 28.
    Winskel, G.: Events in computation. Ph.D.Thesis, University of Edinburgh, Report CST-10-80, December 1980Google Scholar
  29. 29.
    Winskel, G.: Event structure semantics forCCS and related languages. Proc. ICALP 82 (Lect. Notes Comput. Sci., vol. 140, pp. 561–576) Berlin, Heidelberg, New York: Springer 1982Google Scholar
  30. 30.
    Winskel, G.: Synchronisation trees. Theor. Comput. Sci.34, 33–82 (1984)Google Scholar
  31. 31.
    Winskel, G.: Event structures, Petri-nets: applications and relationships to other models of concurrency. (Lect. Notes Comput. Sci., vol. 255, pp. 325–392) Berlin, Heidelberg, New York: Springer 1987Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Christel Baier
    • 1
  • Mila E. Majster-Cederbaum
    • 1
  1. 1.Fakultät für Mathematik und InformatikUniversität MannheimMannheimGermany

Personalised recommendations