TY  - JOUR
ID  - eprints380
JF  - Theoretical Computer Science
AV  - none
SP  - 223
SN  - 0304-3975
UR  - http://www.sciencedirect.com/science/article/pii/030439759090095Y
EP  - 262
PB  - Elsevier
Y1  - 1990///
N2  - 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.
IS  - 3
VL  - 75
TI  - A Partial Ordering Semantics for CCS
A1  - Degano, Pierpaolo
A1  - De Nicola, Rocco
A1  - Montanari, Ugo
ER  -