CCS and Petri Nets

Abstract

It will be assumed that the reader is familiar with the notion of a Petri Net. For an introduction to Petri Net Theory, see [Pet81] and [Bra80]. We will consider agent identifiers, actions, summation, restriction, and parallel composition and relate these CCS concepts to the corresponding Petri Net primitives. It can be shown that for each behaviour tree, a corresponding Petri Net can be found. This illustrates that behaviour tree structures in CCS are a proper subset of the class of Petri Nets. More in particular, CCS trees correspond to 1-safe Petri Nets. A safe Petri Net satisfies the condition that no place will contain more than one token. This constraint assures that the net is bounded.