eprintid: 380
rev_number: 10
eprint_status: archive
userid: 32
dir: disk0/00/00/03/80
datestamp: 2011-06-10 14:15:52
lastmod: 2011-07-11 14:36:27
status_changed: 2011-06-10 14:15:52
type: article
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: A Partial Ordering Semantics for CCS
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: A new operational semantics for “pure” CCS is proposed that considers the parallel operator as a first class one, and permits a description of the calculus in terms of partial orderings. The new semantics (also for unguarded agents) is given in the SOS style via the partial ordering derivation relation. CCS agents are decomposed into sets of sequential subagents. The new derivations relate sets of subagents, and describe their actions and the casual dependencies among them. The computations obtained by composing partial ordering derivations are “observed” either as interleaving or partial orderings of events. Interleavings coincide with Milner's many step derivations, and “linearizations” of partial orderings are all and only interleavings. Abstract semantics are obtained by introducing two relations of observational equivalence and congruence that preserve concurrency. These relations are finer than Milner's in that they distinguish interleaving of sequential nondeterministic agents from their concurrent execution.
date: 1990
date_type: published
publication: Theoretical Computer Science
volume: 75
number: 3
publisher: Elsevier
pagerange: 223-262
id_number: 10.1016/0304-3975(90)90095-Y
refereed: TRUE
issn: 0304-3975
official_url: http://www.sciencedirect.com/science/article/pii/030439759090095Y
citation:   Degano, Pierpaolo and De Nicola, Rocco and Montanari, Ugo  A Partial Ordering Semantics for CCS.  Theoretical Computer Science, 75 (3).  pp. 223-262.  ISSN 0304-3975      (1990)