Non interleaving process algebra

Abstract

We study a non interleaving subalgebra of a reduct of a model of ACP. The model discussed uses step bisimulation semantics. We can derive identities in this model with the help of the (interleaving) ACP calculus with multi-actions. We study the connection with Petri nets, and introduce causalities and a causal state operator.

Graph Isomorphism Models for Non Interleaving Process Algebra

“…Notice that this definition amounts to a free communication function on the set B. This is similar to the approach we used in [3].…”

An algebraic semantics for hierarchical P/T nets

“…Finally, the causal state operator J.. is a special version of the state operator as described in [4]. It is very similar to the causal state operator as defined in [2). A state operator has a parameter, the superscript, and a certain state space, the subscript.…”

“…It is straightforward to extend the results to a step semantics, in which multiple transitions can fire simultaneously. It is only necessary to define the synchronous-merge operator on processes in the same way as the communication merge is defined in [2]. A true concurrency semantics appears to be another interesting candidate for future investigation.…”

“…The communication between these terms corresponds to the flow of tokens. A similar approach is taken by Baeten and Bergstra [2]. Atomic actions in the algebra correspond to transitions in the Pff nets.…”

“…It gives an algebraic semantics for Pff nets. Examples of this approach are Baeten and Bergstra [2], Boudol, Roucairol, and De Simone [11], and Dietz and Schreibert [14]. All three approaches are discussed briefly.…”