%V 199 %L eprints390 %A Pierpaolo Degano %A Rocco De Nicola %A Ugo Montanari %D 1985 %S Lecture Notes in Computer Science %R 10.1007/BFb0028836 %B Fundamentals of Computation Theory (FCT 1985) %E Lothar Budach %X 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. %I Springer %P 520-533 %T Partial ordering derivations for CCS