eprintid: 385
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/85
datestamp: 2011-06-13 09:08:57
lastmod: 2011-07-11 14:36:27
status_changed: 2011-06-13 09:08:57
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: De Nicola, Rocco
creators_name: Hennessy, Matthew
creators_id: r.denicola@imtlucca.it
creators_id: 
title: CCS without tau's
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: 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.
date: 1987
date_type: published
series: Lecture Notes in Computer Science
volume: 249
publisher: Springer
pagerange: 138-152
id_number: 10.1007/3-540-17660-8_53
refereed: TRUE
isbn: 3-540-17660-8
book_title: TAPSOFT '87, Vol.1
editors_name: Ehrig, Hartmut
editors_name: A. Kowalski, Robert
editors_name: Levi, Giorgio
editors_name: Montanari, Ugo
official_url: http://dx.doi.org/10.1007/3-540-17660-8_53
citation:   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)