TY  - CHAP
T2  - Fundamentals of Computation Theory (FCT 1985)
EP  - 533
ID  - eprints390
M1  - 199
N2  - 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.
SN  - 3-540-15689-5
UR  - http://dx.doi.org/10.1007/BFb0028836
TI  - Partial ordering derivations for CCS
AV  - none
ED  - Budach, Lothar
T3  - Lecture Notes in Computer Science
SP  - 520
PB  - Springer
A1  - Degano, Pierpaolo
A1  - De Nicola, Rocco
A1  - Montanari, Ugo
Y1  - 1985///
ER  -