We examine modal and temporal logics for processes. In section 1 we introduce concurrent
processes as terms of an algebraic language comprising a few basic operators, as …

In the concurrent language CCS, two programs are considered the same if they are
bisimilar. Several years and many researchers have demonstrated that the theory of …

The Concurrency Workbench is an automated tool for analyzing networks of finite-state
processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its …

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 …

Abstract The Concurrency Workbench is an automated tool that caters for the analysis of
networks of finite-state processes expressed in Milner's Calculus of Communicating …

We propose a method for the implementation and analysis of real-time systems, based on
the compilation of speci cations into extended automata. Such a method has been already …

In a mobile communication network some nodes change locations, and are therefore
connected to different other nodes at different points in time. We show how some important …

Ce travail propose une méthode pour l'analyse de systèmes temps-reél. Cette méthode est
basée sur la compilation des spécifications vers des graphes temporisés, à partir desquels il …

A number of mutual exclusion algorithms are studied by representing them as agents in the
Calculus of Communicating Systems and using an automated tool embodying some of the …

The questions of program comparison| asking when two programs are equal, or when one is
a suitable substitute for another| are central in the semantics and veri cation of programs. It is …