Partial ordering derivations for CCS

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 a11 interleavings compatible with the partial orderings.