%0 Book Section
%A De Nicola, Rocco
%A Hennessy, Matthew
%B TAPSOFT '87, Vol.1
%D 1987
%E Ehrig, Hartmut
%E A. Kowalski, Robert
%E Levi, Giorgio
%E Montanari, Ugo
%F eprints:385
%I Springer
%P 138-152
%S Lecture Notes in Computer Science
%T CCS without tau's
%U http://eprints.imtlucca.it/385/
%V 249
%X The main point of this paper is that one can develop an adequate version of CCS which does not use the special combinator tau for internal actions. Instead, the choice operator +, whose semantics is somewhat unclear, is replaced by two new choice operators oplus 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.