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)Full text not available from this repository.
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.
|Item Type:||Book Section|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||13 Jun 2011 09:08|
|Last Modified:||11 Jul 2011 14:36|
Actions (login required)