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