In: Concur'97: Concurrency Theory, pages 288-301. July 1997.
Abstract: A high level process algebra, called M-expressions, based on parameterised (multi-)actions is introduced. In the context of the Petri Box Calculus, it serves as a kind of high level counterpart to Box expressions. The semantical intuitions for M-expressions are formalised by defining an operational semantics based on step sequences, similar to that given by Best, Esparza and Koutny for Box expressions. It captures formally what steps each M-expression can perform. The consistency and completeness of the defined operational semantics is proved with respect to the elementary case of Box expressions. The process algebra is applied as the semantic domain for a concurrent programming language, for the control part as well as for the data part, and leads to a compact representation. The consistency and completeness of the operational semantics is proved for this application with respect to an existing high level Petri net semantics.