No abstract

No abstract

No abstract

In this paper we describe the first prototype version of the Mobility Workbench (MWB), an automated tool for manipulating and analyzing mobile concurrent systems (those with evolving connectivity structures) described in the r-calculus. The main feature of this version of the MWB is checking open bisimulation equivalences. We illustrate the MWB with an example automated analysis of a handover protocol for a mobile telephone system. Dedicated to Ellen on the occasion of her birth.

No abstract

No abstract

No abstract

In this paper, we examine equational axiomatisations for congruences over a simple sublanguage of Milner's process algebra CCS. We show that no finite set of equational axioms can completely characterise any reasonablydefined congruence which is at least as strong as Milner's strong congruence. In the case of strong congruence, this means that the Expansion Theorem of CCS cannot be replaced by any finite collection of equational axioms. Moreover, we thus also isolate a source of difficulty in axiomatising any reasonable noninterleaving semantic congruence, where the Expansion Theorem fails to hold.