Modularity of Behaviours for Mathematical Operational Semantics

Some years ago, Turi and Plotkin gave a precise mathematical formulation of a notion of structural operational semantics: their formulation is equivalent to a distributive law of the free monad on a signature over the cofree copointed endofunctor on a behaviour endofunctor. From such a distributive law, one can readily induce a distributive law of the monad over the cofree comonad on the behaviour endofunctor, and much of their analysis can be carried out in the latter terms, adding a little more generality that proves to be vital here. Here, largely at the latter level of generality, we investigate the situation in which one has two sorts of behaviours, with operational semantics possibly interacting with each other. Our leading examples are given by combining action and timing, with a modular account of the operational semantics for the combination induced by that of each of the two components. Our study necessitates investigation and new results about products of comonads and liftings of monads to categories of coalgebras for the product of comonads, providing constructions with which one can readily calculate.

[1]  James Worrell,et al.  On the structure of categories of coalgebras , 2001, Theor. Comput. Sci..

[2]  Gordon D. Plotkin,et al.  Towards a mathematical operational semantics , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[3]  John Power,et al.  Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads , 2000, CMCS.

[4]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[5]  Bart Jacobs,et al.  Mongruences and Cofree Coalgebras , 1995, AMAST.

[6]  G. M. Kelly,et al.  Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads , 1993 .

[7]  P. T. Johnstone,et al.  TOPOSES, TRIPLES AND THEORIES (Grundlehren der mathematischen Wissenschaften 278) , 1986 .

[8]  Michael Makkai,et al.  Accessible categories: The foundations of categorical model theory, , 2007 .

[9]  John Power Towards a theory of mathematical operational semantics , 2003, CMCS.

[10]  G. Kelly A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on , 1980, Bulletin of the Australian Mathematical Society.

[11]  F. Vaandrager,et al.  A Comparison of Additivity Axioms in Timed Transition Systems. , 1993 .

[12]  Marco Kick,et al.  Bialgebraic Modelling of Timed Processes , 2002, ICALP.

[13]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[14]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, CAV.

[15]  S. Lack,et al.  The formal theory of monads II , 2002 .

[16]  James Worrell,et al.  Terminal sequences for accessible endofunctors , 1999, CMCS.

[17]  John Power,et al.  Combining a monad and a comonad , 2002, Theor. Comput. Sci..

[18]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.