CCS without tau's

The main point of this paper is that one can develop an adequate version of CCS which does not use the special combinator τ for internal actions. Instead, the choice operator +, whose semantics is somewhat unclear, is replaced by two new choice operators ⊕ and [], representing internal and external nondeterminism respectively. The operational semantics of the resulting language is simpler and the definition of testing preorders is significantly cleaner. The essential features of the original calculus are kept; this is shown by defining a translation from CCS to the new language which preserves testing preorders.

[1]  Irène Guessarian,et al.  Algebraic semantics , 1981, Lecture Notes in Computer Science.

[2]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[3]  Rocco De Nicola Two Complete Axiom Systems for a Theory of Communicating Sequential Processes , 1985, Inf. Control..

[4]  Rocco De Nicola,et al.  A Complete Set of Axioms for a Theory of Communicating Sequential Processes , 1983, FCT.

[5]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[6]  Matthew Hennessy,et al.  Synchronous and Asynchronous Experiments on Processes , 1984, Inf. Control..

[7]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[8]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[9]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[10]  George J. Milne,et al.  CIRCAL and the representation of communication, concurrency, and time , 1985, TOPL.

[11]  Joseph A. Goguen,et al.  Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[12]  J. W. de Bakker,et al.  Processes and the Denotational Semantics of Concurrency , 1982, Inf. Control..

[13]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[14]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[15]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[16]  Matthew Hennessy,et al.  Acceptance trees , 1985, JACM.