A Theory of Communicating Sequential Processes

Abstract

A mathematical model for communicating sequential processes is given, and a number of its interesting and useful properties are stated and proved. The possibilities of nondetermimsm are fully taken into account.

Verifying properties of large sets of processes with network invariants

“…The failures of a process are the pairs (s, X) where s is a sequence of external actions of the process and X is a set of actions the process can refuse after executing s. We do not want a treatment of divergence 5 as radical as the one in [BHR84] [Mai86], so we add explicit divergence points to our semantics [Old85]. A divergence point is a pair (s, ↑) where s is a sequence of external actions and ↑ is a special symbol indicating that the process can diverge after executing the sequence s. So, for a process defined on the alphabet Σ the semantic domain will be…”

Decidability of bisimulation equivalence for processes generating context-free languages

“…In this paper, we only look at bisimulation semantics (for some other process semantics such as failure semantics, see Section 9). For the question to make sense, we have to transpose the concept of a context-free grammar to the setting of process algebra, as we collectively call the algebraic approaches to process semantics that are exemplified by the work of and of Hoare [9,19] …”

Fair testing

“…Two important families of equivalences are those that employ the notion of bisimulatio, [18,20], and those that are induced by a formalised notion of testing, the so-called testing equivalences [9,14,6]. Bisimulations provide the finer equivalences that keep track of the branching structure of behaviours, and have a rather elegant proof theory based of the construction of bisimulation relations.…”

“…6 we give an alternative characterisation of the should pre-order, based on a generalisation of the concept of failure pairs (cf. [6]). Finally, in Sect.…”