We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on order-theoretic structures to categorytheoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf mod...

We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on ordertheoretic structures to category-theoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf mod...

The theory of traces (the theory of free partial commutative monoids) is used to describe the behavior of systems of concurrent objects. A composition operation on systems and a synchronization operation on behaviors are presented: they allow to derive the behavior of complex systems from the behavior of its components. To address fundamental issues of concurrent semantics for objects in genera...

We construct a cofibrantly generated model structure on the category of flows such that any flow is fibrant and such that two cofibrant flows are homotopy equivalent for this model structure if and only if they are S-homotopy equivalent. This result provides an interpretation of the notion of S-homotopy equivalence in the framework of model categories. 1. Geometric models of concurrency Algebra...

We present a rigorous framework for analyzing timestampbased concurrency control and recovery algorithms for nested transactions. We define a local correctness property, local static atomic@, that affords useful modularity. We show that local static atomicity of each object is sufficient to ensure global serializability. We present generalizations of algorithms due to Reed and Herlihy, and show...

We present a xpoint-analysis machine, for the eecient computation of homogeneous, hierarchical, and alternating xpoints over regular , context-free/push-down and macro models. Applications of such x-point computations include intra-and interprocedural data ow analysis , model checking for various temporal logics, and the veriication of behavioural relations between distributed systems. The xpoi...

Turi and Plotkin's bialgebraic semantics is an abstract approach to specifying the operational of a system, by means distributive law between its syntax (encoded as monad) dynamics (an endofunctor). This setup instrumental in showing that semantic specification (a coalgebra) compositional. In this work, we use derive well-behaved structural string diagrams, graphical increasingly used study int...

We consider CSP from the point of view of the algebraic theory of effects, which classifies operations as effect constructors and effect deconstructors; it also provides a link with functional programming, being a refinement of Moggi’s seminal monadic point of view. There is a natural algebraic theory of the constructors whose free algebra functor is Moggi’s monad; we illustrate this by charact...

Preface This special issue is dedicated to selected papers from the 33rd International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2012), which took place in June 2012 in Hamburg, Germany. In a careful reviewing process, 18 regular papers have been accepted for presentation at the conference among 55 submissions. Then, after the conference, a collection of pap...