Unifying Petri nets with restricted occurrence rule using partial algebra

The aim of this paper is to present a unifying concept for Petri nets with restricted occurrence rule, to obtain non-sequential semantics in a systematic way. It is shown that partial algebra is a suitable basis for process construction. Restrictions of the occurrence rule are translated into restrictions of concurrent composition of processes. We illustrate this claim on several well-known examples, including context and capacity restrictions. For elementary nets with context we show the one-toone correspondence between processes constructed using partial algebra and partial order based processes