Notes on the methodology of CCS and CSP

Theoretical Computer Science

Volumn 177, Issue 2, 1997, Pages 329-349

  Van Glabbeek, R J ^a,b  

^a Stanford University   (United States)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMMUNICATION; CONCURRENCY CONTROL; INFORMATION THEORY; SEQUENTIAL MACHINES; TOPOLOGY;

COMMUNICATING PROCESSES;

COMMUNICATION SYSTEMS;

EID: 0031145639     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00251-4     Document Type: Article

References (18)

1. J.C.M. Baeten, J.A. Bergstra and J.W. Klop, Ready trace semantics for concrete process algebra with priority operator, Computer Journal 30(6) (1987) 498-506.
2. J.C.M. Baeten, J.A. Bergstra and J.W. Klop, Syntax and defining equations for an interrupt mechanism in process algebra, Fund. Inform. IX (1986) 127-168.
3. J.A. Bergstra and J.W. Klop, Algebra of communicating processes, in: J.W. de Bakker, M. Hazewinkel and J.K. Lenstra, eds., Proc. of the CWI Symp. Math. and Comp. Sci. (North-Holland, Amsterdam, 1986) 89-138.
4. J.A. Bergstra, J.W. Klop and E.-R. Olderog, Failures without chaos: a new process semantics for fair abstraction. in: M. Wirsing, ed., Proc. IFIP Working Conf. on the Formal Description of Programming Concepts (Gl. Avernaes, August 1986) (North-Holland, Amsterdam, 1987), 77-103.
5. S.D. Brookes, On the relationship of CCS and CSP, in: J. Diaz, ed., Proc. 10th ICALP, Barcelona, Lecture Notes in Computer Science, Vol. 154 (Springer, Berlin, 1983) 83-96.
6. S.D. Brookes, C.A.R. Hoare and W. Roscoe, A theory of communicating sequential processes, J. ACM 31 (3) (1984) 560-599.
7. J.W. de Bakker and J.I. Zucker, Denotational semantics of concurrency, in: Proc. 14th ACM Symp. on Theory of Computing (1982) 153-158.
8. J.W. de Bakker and J.I. Zucker, Processes and the denotational semantics of concurrency, Inform. and Control 54 (1/2) (1982) 70-120.
9. R. De Nicola, A complete set of axioms for a theory of communicating sequential processes, in: Found of Comp. Theory, Lecture Notes in Computer Science, Vol. 158 (Springer, Berlin, 1983) 115-126.
10. C.A.R. Hoare, Communicating Sequential Processes (Prentice-Hall, Englewood Cliffs, NJ, 1985).
11. S.C. Kleene, Representation of events in nerve nets and finite automata, in: Automata Studies, (Princeton Univ. Press, Princeton, 1956) 3-41.
12. R. Milner, A Calculus for Communicating Systems, Lecture Notes in Computer Science, Vol. 92 (Springer, Berlin, 1980).
13. R. Milner, Lectures on a Calculus for Communicating Systems, Seminar on Concurrency, Lecture Notes in Computer Science, Vol. 197 (Springer, Berlin, 1985).
14. E.-R. Olderog and C.A.R. Hoare, Specification-oriented semantics for communicating processes. Acta Informatica 23 (1986) 9-66.
15. D.M.R. Park, Concurrency and automata on infinite sequences, in: Proc 5th GI Conf., Lecture Notes in Computer Science, Vol. 104 (Springer, Berlin, 1981).
16. W. Reisig, Petrinetze (Springer, Berlin, 1982).
17. M. Rem, Partially ordered computations, with applications to VLSI design, in: J.W. de Bakker and J. van Leeuwen, eds., Proc. 4th Advanced Course on Found. Comp. Sci., part 2, Tract 159 (Mathematisch Centrum, Amsterdam, 1983).
18. A. Salomaa, Two complete axiom systems for the algebra of regular events, J. ACM 13 (1) (1966) 158-169.