We report a negative result on the characterisation of partial order equivalence relations
over models which feature a global notion of event independence. We show an example of …

Event structure models often have some constraint which ensures that for each system run it
is clear what are the causal predecessors of an event (ie there is no causal ambiguity). In …

The intention of the paper is to show the applicability of the general categorical framework of
open maps to the setting of timed extensions of partial order models, in order to transfer …

In the first part we give a general analysis of concurrency. We model computations as
structures over multisets of actions with two strict partial orders: causal precedence (in a …

Noninterleaving models of concurrency assume that behavioural properties of systems can
be adequately modelled in terms of causal partial orders. We claim that the structure of …

We investigate equivalence notions for concurrent systems. We consider” linear time”
approaches where the system behaviour is characterised as the set of possible runs as well …

We investigate equivalence notions for concurrent systems. We consider” linear time”
approaches where the system behaviour is characterised as the set of possible runs as well …

This note continues a series of papers in the Bulletin of the EATCS about the relative merits
of partial order semantics and interleaving semantics, starting with [CDP]. That paper …

We study the use of sets of labelled partial orders (pomsets) as denotational models for
process algebras. More specifically, we study their capability to capture degrees of …

Several notions of semantic equivalence, whose aim is to fully reflect the interplay between
nondeterminism and causality, have recently been proposed for models and languages for …