Conditionals in Algebraic Process Calculi

AbstractConditionals of some form are incorporated in various algebraic process calculi. What is considered to be conditions and how they are evaluated differs from one case to another. This paper gives an overview of the history of conditionals in algebraic process calculi, including the recent elaborate investigation into the potentialities of conditionals in the setting of ACP. The history of conditionals in algebraic process calculi is remarkable. It shows among other things that the potentialities of conditionals in algebraic process calculi have been underestimated for a long time. The paper ends by mentioning some open problems

An algebraic approach to transactional processes

Abstract We present a set of operators in order to simplify the modelling of transactional behaviour of processes using process algebra. We give an axiomatic semantics of the operators presented. Apart from that, we give their operational semantics using Plotkin-style deduction rules. Our goal is to give formal speci¯cations of Internet applications using process algebra, for which transactional behaviour should be modelled

An Example of Using Basic Process Algebra with Backtracking for State Space Searching (Search).

Available from STL Prague, CZ / NTK - National Technical LibrarySIGLECZCzech Republi

A Semantic Approach to Protocold using Process Algebra

We study of the operational behaviour of the specification language Protocold. We examine whether BPA(+) (Basic Process Algebra with backtracking) forms a useful basis for a clear representation of the execution of certain language constructs from Protocold. Our primary focus is on those constructs that contain some form of backtracking. Backtracking in Protocold contains the undoing of bindings of object names (logical variables). We first provide a short introduction to both formalisms, and then make a rough comparison of them both. Some elementary Protocold features, such as object names and the binding of object names, are then defined relative to a special data environment for BPA(+). Finally, a small language PCL is defined for the description of the operational behaviour of Protocold-like expressions, as well as a mapping from \Sigma(PC L) expressions to \Sigma(BPA(+)) terms. Some operational equivalences that hold in Protocold are defined as rules in PCL , such that algebraic m..