Reading material

Lecture notes on CCS.

Additional material

More about CCS can be found in

Question

A labelled transition system consists of

Labelled transition systems are very similar to finite automata. The main differences are that the set of states and the set of actions of a labelled transition system need not be finite, and that a labelled transition system does not have a designated start state and a set of final states.

When should two states of a labelled transition system be considered behaviourally equivalent?