Message passing is a useful abstraction for implementing concurrent programs. For real-world systems, however, it often combined with other programming and concurrency paradigms, such as higher-order functions, mutable state, shared-memory concurrency, locks. We present Actris: logic proving functional correctness of programs that use combination the aforementioned features. Actris combines pow...

The paper analyzes interdependencies between strategies of players in a Nash equilibrium using independence relation between two sets of players. A sound and complete axiomatization of this relation is given. It has been shown previously that the same axiomatic system describes independence in probability theory, information flow, and concurrency theory.

Coalgebraic techniques are applied to the supervisory control of discrete-event systems with partial observations. Classical notions from concurrency theory are specialized to control theory. The concept of weak transitions enables the relational characterization of observability and gives rise to a coalgebraic formulation of the necessary and sufficient conditions for the existence of a superv...

We define labeling homomorphisms on the cubical homology of higher-dimensional automata and show that they are natural with respect to cubical dimaps and compatible with tensor products. We also indicate two possible applications of labeled homology in concurrency theory.

One natural way to generalize Domain Theory is to replace partially ordered sets by categories. This kind of generalization has recently found application in the study of concurrency. An outline is given of the elegant mathematical foundations which have been developed. This is specialized to give a construction of cartesian closed categories of domains, which throws light on standard presentat...

Geometrical methods in concurrency theory (and in distributed systems theory) have appeared recently for modelling and analyzing systems' behaviours and also for solving computability and complexity issues. We identify some of the main directions of research and survey some of the major ideas on which all this is based on (some of which are more than thirty years old).

We enhance the notion of a computation of the classical theory of computing with the notion of interaction from concurrency theory. In this way, we enhance a Turing machine as a model of computation to a Reactive Turing Machine that is an abstract model of a computer as it is used nowadays, always interacting with the user and the world.

A proof of decidability of equivalence between deterministic pushdown automata is presented using a mixture of methods developed in concurrency and language theory. The technique appeals to a tableau proof system for equivalence of configurations of strict deterministic grammars.

True Concurrency: Adhesive Processes Paolo Baldan, Andrea Corradini, Tobias Heindel, Barbara König, and Pawe l Sobociński 1 Dipartimento di Informatica, Università Ca’ Foscari di Venezia, Italy 2 Dipartimento di Informatica, Università di Pisa, Italy 3 Institut für Formale Methoden der Informatik, Universität Stuttgart, Germany 4 Computer Laboratory, University of Cambridge, United Kingdom Abst...

A formal framework for specifying and developing agents/robots must handle not only knowledge and sensing actions, but also time and concurrency. Researchers have extended the situation calculus to handle knowledge and sensing actions. Other researchers have addressed the issue of adding time and concurrent actions. Here both of these features are combined into a unified logical theory of knowl...