relation: http://eprints.imtlucca.it/385/
title: CCS without tau's
creator: De Nicola, Rocco
creator: Hennessy, Matthew
subject: QA75 Electronic computers. Computer science
description: 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.
publisher: Springer
contributor: Ehrig, Hartmut
contributor: A. Kowalski, Robert
contributor: Levi, Giorgio
contributor: Montanari, Ugo
date: 1987
type: Book Section
type: PeerReviewed
identifier:   De Nicola, Rocco and Hennessy, Matthew  CCS without tau's.   In:  TAPSOFT '87, Vol.1.   Lecture Notes in Computer Science, 249 .  Springer, pp. 138-152.  ISBN 3-540-17660-8      (1987)  
relation: http://dx.doi.org/10.1007/3-540-17660-8_53
relation: 10.1007/3-540-17660-8_53