TCSP: Theory of communicating sequential processes

  • Ernst-Rüdiger Olderog
Section 8 Relationship To Other Models Of Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 255)


The operators and failure semantics of TCSP, the "Theory of Communicating Sequential Processes" initiated by Brookes, Hoare and Roscoe, are explained. The operators are viewed as devices for structuring nondeterministic machines and the failure semantics as a mechanism for abstracting from internal process activity. A new full abstraction result for failure semantics is stated. The relationship to the COSY formalism of Lauer et al. and Milner's CCS is discussed.

Key words

Process automaton labelled transition system strong bisimulation communication synchronization parallelism nondeterminism deadlock recursion divergence abstraction from internal activity hiding linear history refusal set failure equivalence observational equivalence operational and denotational semantics full abstraction CSP TCSP CCS COSY 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. /dB/.
    J.W. de Bakker, Mathematical Theory of Program Correctness (Prentice Hall, London, 1980).Google Scholar
  2. /BK01/.
    J.A. Bergstra, J.W. Klop, E.-R. Olderog, Readies and failures in the algebra of communicating processes, Tech. Report CS-R8523, CWI Amsterdam, 1985.Google Scholar
  3. /BK02/.
    J.A. Bergstra, J.W. Klop, E.-R. Olderog, Failures without chaos: a new process semantics for fair abstraction, to appear in: M. Wirsing (Ed.), Proc. IFIP Working Conference on Formal Description of Programming Concepts 1986 (North-Holland, Amsterdam, 1987).Google Scholar
  4. /Be/.
    E. Best, in this volume.Google Scholar
  5. /Br/.
    S.D. Brookes, On the relationship of CCS and CSP, in: J. Diaz (Ed.), Proc. 10th ICALP, LNCS 154 (Springer-Verlag, 1983) 83–96.Google Scholar
  6. /BHR/.
    S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, A theory of communicating sequential processes, J. ACM 31 (1984) 560–599.CrossRefGoogle Scholar
  7. /BR/.
    S.D. Brookes, A.W. Roscoe, An improved failures model for communicating sequential processes, in: S.D. Brookes, A.W. Roscoe, G. Winskel (Eds.), Seminar on Concurrency, LNCS 197 (Springer-Verlag, 1985) 281–305.Google Scholar
  8. /By/.
    M.Broy, Process semantics of communicating concurrent programs, Bericht MIP-8602, Fak. Math. u. Inform., Univ. Passau, 1986.Google Scholar
  9. /CH/.
    R.H. Campbell, A.N. Habermann, The specification of process synchronisation by path expressions, LNCS 16 (Springer-Verlag, 1974).Google Scholar
  10. /Cz/.
    L. Czaja, Making nets structured and abstract, in: G. Rozenberg (Ed.), Advances in Petri Nets 1985, LNCS 222 (Springer-Verlag, 1985) 181–202.Google Scholar
  11. /DDM/.
    P. Degano, R. DeNicola, U. Montanari, A new operational semantics for CCS based on condition/event systems, Nota Interna B4-42, Dept. of Comp. Science, Univ. Pisa, 1986.Google Scholar
  12. /DH/.
    R. DeNicola, M. Hennessy, Testing equivalences for processes, TCS 34 (1984) 83–134Google Scholar
  13. /Go/.
    M. Gordon, The Denotational Description of Programming Languages (Springer-Verlag, New York, 1979).Google Scholar
  14. /Gz/.
    U. Goltz, Building structured Petri nets, Arbeitspapiere der GMD Nr. 223, Gesellschaft Math. Datenverarbeitung, Bonn, 1986.Google Scholar
  15. /GM/.
    U. Goltz, A. Mycroft, On the relationship of CCS and Petri nets, in: J. Paredaens (Ed.), Proc. 11th ICALP, LNCS 172 (Springer-Verlag, 1984) 196–208.Google Scholar
  16. /He/.
    M. Hennessy, Acceptance trees, J. ACM 32 (1985) 896–928.Google Scholar
  17. /HM/.
    M. Hennessy, R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32 (1985) 137–161.Google Scholar
  18. /HP1/.
    M. Hennessy, G.D. Plotkin, Full abstraction for a simple programming language, in: J. Becvar (Ed.), Proc. 8th MFCS, LNCS 74 (Springer-Verlag, 1979) 108–120.Google Scholar
  19. /HP2/.
    M. Hennessy, G.D. Plotkin, A term model for CCS, in P. Dembinski (Ed.), Proc. 9th MFCS, LNCS 88 (Springer-Verlag, 1980) 261–274.Google Scholar
  20. /Ho1/.
    C.A.R. Hoare, Communicating sequential processes, Comm. ACM (1978) 666–677.Google Scholar
  21. /Ho2/.
    C.A.R. Hoare, Communicating Sequential Processes (Prentce Hall, London, 1985).Google Scholar
  22. /HBR/.
    C.A.R. Hoare, S.D. Brookes, A.W. Roscoe, A theory of communicating sequential processes, Tech. Monograph PRG-16, Oxford Univ., Progr. Research Group (1981).Google Scholar
  23. /Lo/.
    R. Loogen, Ein semantisches Modell für nichtdeterministische, parallele Prozesse, Diplomarbeit, Inst. f. Inform., RWTH Aachen, 1985.Google Scholar
  24. /Ma/.
    A. Mazurkiewicz, in this volume.Google Scholar
  25. /Mi1/.
    R. Milner, Fully abstract models of typed λ-calculi, TCS 4 (1977) 1–22.Google Scholar
  26. /Mi2/.
    R. Milner, A Calculus of Communicating Systems, LNCS 92 (Springer-Verlag, 1980).Google Scholar
  27. /Mi3/.
    R. Milner, A modal characterisation of observable machine-behaviour, in: E. Astesiano, C. Böhm (Eds.), Proc. 6th CAAP, LNCS 112 (Springer-Verlag, 1981) 25–34.Google Scholar
  28. /Mi4/.
    R. Milner, Calculi for synchrony and asynchrony, TCS 25 (1983) 267–310.Google Scholar
  29. /Ni/.
    M. Nielson, in this volume.Google Scholar
  30. /Ol1/.
    E.-R. Olderog, Process theory: semantics, specification and verification, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg (Eds.), Current Trends in Concurrency, LNCS 224 (Springer-Verlag, 1986) 442–509.Google Scholar
  31. /O12/.
    E.-R. Olderog, Concurrent processes: the search for structure and abstraction, part I and II, invited tutorial, Bull. EATCS 28 (1986) 73–97 and 29 (1986) 96–117.Google Scholar
  32. /OH/.
    E.-R. Olderog, C.A.R. Hoare, Specification-oriented semantics for communicating processes, Acta Inform. 23 (1986) 9–66.Google Scholar
  33. /Pa/.
    D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proc. 5th GI Conf. on Theoret. Comp. Science, LNCS 104 (Springer-Verlag, 1981).Google Scholar
  34. /Pl1/.
    G.D. Ploktin, Structural approach to operational semantics, Tech. Report DAIMI FN-19, Comp. Science Dept., Aarhus Univ., 1981.Google Scholar
  35. /P12/.
    G.D. Plotkin, An operational semantics for CSP, in: D. Björner (Ed.), Formal Description of Programming Concepts II (North-Holland, Amsterdam, 1982) 199–225.Google Scholar
  36. /P13/.
    G.D. Plotkin, LCF considered as a programming language, TCS 5 (1977) 223–255.Google Scholar
  37. /Po/.
    L. Pomello, Some equivalence notions for concurrent systems. An overview, in: G. Rozenberg (Ed.), Advances in Petri Nets 1985, LNCS 222 (Springer-Verlag, 1985) 381–400.Google Scholar
  38. /RS/.
    M.O. Rabin, D.S. Scott, Finite automata and their decision problems, IBM J. Res. 3:2, 1959.Google Scholar
  39. /Re/.
    W. Reisig, Partial order semantics versus interleaving semantics for CSP-like languages and its impact on fairness, in: J. Paredaens (Ed.), Proc. 11th ICALP, LNCS 172 (Springer-Verlag, 1984) 403–413.Google Scholar
  40. /St/.
    J.E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory (MIT Press, Cambridge, Mass., 1977).Google Scholar
  41. /Ta/.
    D.A. Taubner, Two net oriented semantics for TCSP, Bericht Nr.116/85, Fachbereich Inform., Univ. Hamburg, 1985.Google Scholar
  42. /Wi/.
    G. Winskel, in this volume.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Ernst-Rüdiger Olderog
    • 1
  1. 1.Institut für Informatik und Praktische MathematikChristian-Albrechts-Universität KielKiel .1Fed. Rep. Germany

Personalised recommendations