Place/Transition (PT) Petri nets are one of the most widely used models of concurrency. However, they still lack, in our view, a satisfactory semantics: on the one hand the ‘token game’ is too intensional, even in its more abstract interpretations in terms of nonsequential processes and monoidal categories; on the other hand, Winskel’s basic unfolding construction, which provides a coreflection...

Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical, intuitionistic, and diverse substructural logics. Here we show there are those dual adjunctions that have inherent hyperdoctrine structures in their predicate functo...

In this paper we re-develop the foundations of the category theory of quasicategories (also called ∞-categories) using 2-category theory. We show that Joyal’s strict 2-category of quasi-categories admits certain weak 2-limits, among them weak comma objects. We use these comma quasi-categories to encode universal properties relevant to limits, colimits, and adjunctions and prove the expected the...

We present ongoing work into the systematic study of the use of dual adjunctions in coalgebraic modal logic. We introduce a category of internal models for a modal logic. These are constructed from syntax, and yield a generalised notion of canonical model. Further, expressivity of a modal logic is shown to be characterised by factorisation of its models via internal models and the existence of ...

If a Quillen model category is defined via a suitable right adjoint over a sheafifiable homotopy model category (in the sense of part I of this paper), it is sheafifiable as well; that is, it gives rise to a functor from the category of topoi and geometric morphisms to Quillen model categories and Quillen adjunctions. This is chiefly useful in dealing with homotopy theories of algebraic structu...

Kleene algebras are an important class of algebraic structures that arise in diverse areas of computer science: program logic and semantics, relational algebra, automata theory, and the design and analysis of algorithms. The literature contains several inequivalent deenitions of Kleene algebras and related algebraic structures 2, 14, 15, 5, 6, 1, 10, 7]. In this paper we establish some new rela...

The “in the large” properties of typed graph transformation systems in the double pushout framework and a double pullback variation of it, are reexamined for injective productions (for which the theory is strictly richer than in the general case). Preceding accounts utilising a fixed choice of pullbacks (whether adopted directly or via partial morphisms) are seen to be excessively sensitive to ...

We pursue the definition of a KZ-doctrine in terms of a fully faithful adjoint string Dd m dD. We give the definition in any Gray-category. The concept of algebra is given as an adjunction with invertible counit. We show that these doctrines are instances of more general pseudomonads. The algebras for a pseudomonad are defined in more familiar terms and shown to be the same as the ones defined ...