Transition systems are a simple and powerful formalism for explaining the operational behaviour of models of concurrency. They provide a common framework for investigating the interrelationships between different approaches to the study of distributed systems. Hence an important question to be answered is: which subclass of transition systems corresponds to a particular model of distribted syst...

Abstract Combinatorial games are widely used in finite model theory, constraint satisfaction, modal logic and concurrency theory to characterize logical equivalences between structures. In particular, Ehrenfeucht–Fraïssé games, pebble bisimulation play a central role. We show how each of these types can be described terms an indexed family comonads on the category relational structures homomorp...

Recently, distributed shared memory (DSM) systems have received much attention because such an abstraction simpliies programming. It has been shown that many practical applications using DSMs require competing operations. We have aimed at unifying theory and implementations of protocols for sequential consistency, which provides competing operations. By adopting concepts from concurrency contro...

We develop theory of algebra over processes, based on an abstract treatment of process structure. The abstract framework of process structures is developed (Part I), and, on its basis, theory of algebra is developed where the basic results including Birkho -like Variety Theorem are proved (Part II). We also discuss properties of signi cant concrete examples of algebras, taken from extant theori...

Modelling distributed and mobile systems at a suitable level of abstraction maybe considered the main application area of process calculi and graph transformation systems. Analysis and verification methods for the resulting models abound. Here we focus on two lines of research: on the one hand the work following the influential theory of Reactive Systems (rs) [6] (originally developed for proce...