%0 Book Section
%A Degano, Pierpaolo
%A De Nicola, Rocco
%A Montanari, Ugo
%B Fundamentals of Computation Theory (FCT 1985)
%D 1985
%E Budach, Lothar
%F eprints:390
%I Springer
%P 520-533
%S Lecture Notes in Computer Science
%T Partial ordering derivations for CCS
%U http://eprints.imtlucca.it/390/
%V 199
%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.