Skip to main content
SpringerLink
Log in

TCSP: Theory of communicating sequential processes

  • Section 8 Relationship To Other Models Of Concurrency
  • Conference paper
  • First Online:
Petri Nets: Applications and Relationships to Other Models of Concurrency (ACPN 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 255))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. References

  1. J.W. de Bakker, Mathematical Theory of Program Correctness (Prentice Hall, London, 1980).

    Google Scholar 

  2. 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. 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. E. Best, in this volume.

    Google Scholar 

  5. 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. S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, A theory of communicating sequential processes, J. ACM 31 (1984) 560–599.

    Article  Google Scholar 

  7. 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. M.Broy, Process semantics of communicating concurrent programs, Bericht MIP-8602, Fak. Math. u. Inform., Univ. Passau, 1986.

    Google Scholar 

  9. R.H. Campbell, A.N. Habermann, The specification of process synchronisation by path expressions, LNCS 16 (Springer-Verlag, 1974).

    Google Scholar 

  10. 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. 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. R. DeNicola, M. Hennessy, Testing equivalences for processes, TCS 34 (1984) 83–134

    Google Scholar 

  13. M. Gordon, The Denotational Description of Programming Languages (Springer-Verlag, New York, 1979).

    Google Scholar 

  14. U. Goltz, Building structured Petri nets, Arbeitspapiere der GMD Nr. 223, Gesellschaft Math. Datenverarbeitung, Bonn, 1986.

    Google Scholar 

  15. 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. M. Hennessy, Acceptance trees, J. ACM 32 (1985) 896–928.

    Google Scholar 

  17. M. Hennessy, R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32 (1985) 137–161.

    Google Scholar 

  18. 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. 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. C.A.R. Hoare, Communicating sequential processes, Comm. ACM (1978) 666–677.

    Google Scholar 

  21. C.A.R. Hoare, Communicating Sequential Processes (Prentce Hall, London, 1985).

    Google Scholar 

  22. 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. R. Loogen, Ein semantisches Modell für nichtdeterministische, parallele Prozesse, Diplomarbeit, Inst. f. Inform., RWTH Aachen, 1985.

    Google Scholar 

  24. A. Mazurkiewicz, in this volume.

    Google Scholar 

  25. R. Milner, Fully abstract models of typed λ-calculi, TCS 4 (1977) 1–22.

    Google Scholar 

  26. R. Milner, A Calculus of Communicating Systems, LNCS 92 (Springer-Verlag, 1980).

    Google Scholar 

  27. 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. R. Milner, Calculi for synchrony and asynchrony, TCS 25 (1983) 267–310.

    Google Scholar 

  29. M. Nielson, in this volume.

    Google Scholar 

  30. 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. 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. E.-R. Olderog, C.A.R. Hoare, Specification-oriented semantics for communicating processes, Acta Inform. 23 (1986) 9–66.

    Google Scholar 

  33. 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. G.D. Ploktin, Structural approach to operational semantics, Tech. Report DAIMI FN-19, Comp. Science Dept., Aarhus Univ., 1981.

    Google Scholar 

  35. 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. G.D. Plotkin, LCF considered as a programming language, TCS 5 (1977) 223–255.

    Google Scholar 

  37. 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. M.O. Rabin, D.S. Scott, Finite automata and their decision problems, IBM J. Res. 3:2, 1959.

    Google Scholar 

  39. 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. J.E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory (MIT Press, Cambridge, Mass., 1977).

    Google Scholar 

  41. D.A. Taubner, Two net oriented semantics for TCSP, Bericht Nr.116/85, Fachbereich Inform., Univ. Hamburg, 1985.

    Google Scholar 

  42. G. Winskel, in this volume.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, 2300, Kiel .1, Fed. Rep. Germany

    Ernst-Rüdiger Olderog

Authors
  1. Ernst-Rüdiger Olderog
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

W. Brauer W. Reisig G. Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Olderog, ER. (1987). TCSP: Theory of communicating sequential processes. In: Brauer, W., Reisig, W., Rozenberg, G. (eds) Petri Nets: Applications and Relationships to Other Models of Concurrency. ACPN 1986. Lecture Notes in Computer Science, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17906-2_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-17906-2_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17906-1

  • Online ISBN: 978-3-540-47926-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation