Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a
general framework for unifying a wide variety of models of concurrency. Concurrent rewriting …

This is, we believe, the final version of a chaper for the Handbook of Logic and the
Foundations of Computer Science, vol. IV, Oxford University Press. It surveys a range of …

This book is a revised edition of the monograph which appeared under the same title in the
series Research Notes in Theoretical Computer Science, Pit man, in 1986. In addition to a …

We show in this article that some concepts from homotopy theory, in algebraic topology, are
relevant for studying concurrent programs. We exhibit a natural semantics of semaphore …

Models for concurrency can be classified with respect to three relevant parameters:
behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a …

In this paper I compare the expressive power of several models of concurrency based on
their ability to represent causal dependence. To this end, I translate these models, in …

When using labelled transition systems to model languages like CCS or TCSP, one
specifies transitions by a set of structural rules. We consider labelling transitions with their …

Geometrical methods in concurrency theory (and in distributed systems theory) have
appeared recently for modelling and analyzing the behaviour of systems and also for solving …

Abstract Models for concurrency can be classified with respect to the three relevant
parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When …

An axiomatic version of the standardization theorem that shows the necessary basic
properties between nesting of redexes and residuals is presented. This axiomatic approach …