eprintid: 390
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/90
datestamp: 2011-05-24 14:02:06
lastmod: 2011-07-11 14:36:27
status_changed: 2011-05-24 14:02:05
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: Degano, Pierpaolo
creators_name: De Nicola, Rocco
creators_name: Montanari, Ugo
creators_id: 
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Partial ordering derivations for CCS
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: In this paper we extend CCS transitions, labelled by strings, to concurrent histories, i.e. to transitions labelled by partial orderings. The two notions are linked by a theorem which shows that the strings can be obtained by taking all interleavings compatible with the partial orderings.
date: 1985
date_type: published
series: Lecture Notes in Computer Science
volume: 199
publisher: Springer
pagerange: 520-533
id_number: 10.1007/BFb0028836
refereed: TRUE
isbn: 3-540-15689-5
book_title: Fundamentals of Computation Theory (FCT 1985)
editors_name: Budach, Lothar
official_url: http://dx.doi.org/10.1007/BFb0028836
citation:   Degano, Pierpaolo and De Nicola, Rocco and Montanari, Ugo  Partial ordering derivations for CCS.   In:  Fundamentals of Computation Theory (FCT 1985).   Lecture Notes in Computer Science, 199 .  Springer, pp. 520-533.  ISBN 3-540-15689-5      (1985)