Using the axiomatic presentation of behavioural equivalences for manipulating CCS specifications

Abstract

An interactive system for proving properties of CCS specifications is described. This system allows users to take advantage of all three views of CCS semantics (the transitions, the operationally defined equivalences and the axioms) and to define their own verification strategies for moving from one view to another. The system relies on term rewriting techniques and manipulates only the symbolic representation of specifications without resorting to any other kind of internal representation.1 This research has been partially supported by the CEC under ESPRIT project 2304 -LOTOSPHERE.

Automatic verification of distributed systems: The process algebra approach

“…CRLAB is a system based on rewriting strategies [28,29]. It is written in Quintus Prolog and runs on SUN-3 Workstations.…”

Three logics for branching bisimulation

“…every sequence of (visible and silent) actions and states, of one system has a correspondent in the other; corresponding computations have the same sequence of visible actions and are such that all their intennediate states have equivalent potentials. Branching bisimulation is more restrictive than weak observational equivalence but has a pleasant axiomatic characterization which leads to a complete canonical tenn rewriting system [DIN90] and does indeed preserve the branching structures of systems.…”

Assisting requirement formalization by means of natural language translation

“…NL2ACTL has been integrated into the verification environment JACK [13] (see Figure 2), which is able to cover a large extent of the formal software development process, such as rewriting techniques [6], behavioural equivalence proofs [11,15], graph transformations [23], and logic verification [5,9].…”