We re-examine bisimulation equivalence for value-passing process languages in which
actions have associated with them values from a possibly infinite value set. Using symbolic …

Abstract In June 1998, a Steering and Revisions Committee of the International Institute for
the Unification of Private Law (Unidroit) fleshed out the final version of a" Draft Unidroit …

We give sound and complete proof systems for a variety of bisimulation based equivalences
over a message-passing process algebra. The process algebra is a generalisation of pure …

G. Bruns (1995) has proposed a version of value-passing CCS in which an agent language,
based on that proposed by Milner, is augmented with a rich data language. The data …

A proof system is described which is capable of handling processes with valuepassing. It
implements inference systems that treats data and boolean expressions symbolically. Users …

We build on existing work in structured and formal methods integration by proposing a
formal denotational semantic function between the syntax of Ward/Mellor SA/RT models and …

This report considers the problem of interpreting behavioural meanings from model-based
speci cations written in formal speci cation languages such as Z, VDM-SL or AMN. It …

Milner's value-passing calculus for describing and reasoning about communicating systems
is formalised in the HOL proof assistant. Based on a previously defined mechanisation of …

We describe the implementation of a tool for analysing systems described in the TPCCS
process algebra (CCS extended with time and probability). The tool essentially provides …

The MSMIE protocol [SBC89] allows processors in a distributed system to communicate via
shared memory. It was designed to meet the reliability and efficiency needs of applications …