Results 1 
4 of
4
Towards a Mathematical Operational Semantics
 In Proc. 12 th LICS Conf
, 1997
"... We present a categorical theory of `wellbehaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown that, if the operational rules of a programming language can be modelled as a natural transforma ..."
Abstract

Cited by 135 (9 self)
 Add to MetaCart
We present a categorical theory of `wellbehaved' operational semantics which aims at complementing the established theory of domains and denotational semantics to form a coherent whole. It is shown that, if the operational rules of a programming language can be modelled as a natural transformation of a suitable general form, depending on functorial notions of syntax and behaviour, then one gets both an operational model and a canonical, internally fully abstract denotational model for free; moreover, both models satisfy the operational rules. The theory is based on distributive laws and bialgebras; it specialises to the known classes of wellbehaved rules for structural operational semantics, such as GSOS.
Classes of Finite State Automata for Which Compositional Minimization is Linear Time
, 2001
"... This paper is a contribution to the theoretical analysis of the problems which are tractable using the method ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper is a contribution to the theoretical analysis of the problems which are tractable using the method
On Automata with Boundary
, 1999
"... We present a theory of automata with boundary for designing, modelling and analysing distributed systems. Notions of behaviour, design and simulation appropriate to the theory are dened. The problem of model checking for deadlock detection is discussed, and an algorithm for state space reduction ..."
Abstract
 Add to MetaCart
We present a theory of automata with boundary for designing, modelling and analysing distributed systems. Notions of behaviour, design and simulation appropriate to the theory are dened. The problem of model checking for deadlock detection is discussed, and an algorithm for state space reduction in exhaustive search, based on the theory presented here, is described. Three examples of the application of the theory are given, one in the course of the development of the ideas and two as illustrative examples of the use of the theory.
On the Semantics of Message Passing Processes
, 1999
"... Let J be a shape in some category Shp for which there is a functor : Shp Cat. A categorical transition system (or system) is a pair (J; (J) C) consisting of a shape labelled by a functor in a category in C. Systems generalize conventional labelled transition systems. By choosing a suitable univer ..."
Abstract
 Add to MetaCart
Let J be a shape in some category Shp for which there is a functor : Shp Cat. A categorical transition system (or system) is a pair (J; (J) C) consisting of a shape labelled by a functor in a category in C. Systems generalize conventional labelled transition systems. By choosing a suitable universe of shapes, systems can model concurrent and asynchronous computation. By labelling in a category, rather than an alphabet or term algebra, the actions of an algorithm or process can have structure. We study a class of systems called twisted systems having the form S = (J; F e J C) where J is a reflexive graph and g (\Gamma) : RGrph RGrph is the twisted graph construction. The relevance of twisted systems lies in the relationship between twists and spans. A functor FJ Sp(C) into a bicategory of spans is equivalent to a functor F e J C. The connection with spans means that when the target category C = Set, then following Burstall, a twisted system can be viewed as a generalized flowchart...