A truly concurrent semantics for a process algebra using resource pomsets

In this paper we study a process algebra whose semantics is based on true concurrency. In our model, actions are defined in terms of the resources they need to execute, which allows a simple definition of a weak sequential composition operator. This operator allows actions which do not share any resources to execute concurrently, while dependent actions have to occur sequentially. This weak sequential composition operator may be used to automatically parallelize a sequential process. We add the customary (strict) sequential composition and a parallel composition operator allowing synchronization on specified actions. Our language also supports a hiding operator that allows the hiding of actions and even of individual resources used by actions. Strict sequential composition and hiding require that we generalize from the realm of Mazurkiewicz traces to that of pomsets, since these operations introduce "over-synchronized" traces

• Type: Journal
• Year: 2002
• Where: TCS
• Authors: Paul Gastin, Michael W. Mislove
• Keywords: Sequential Composition, Sequential Composition Operator, TCS 2002, Theoretical Computer Science, Weak Sequential Composition