Towards a theory of mathematical operational semantics

Turi and Plotkin gave a precise mathematical formulation of a notion of structural operational semantics in their paper “Towards a mathematical operational semantics.” Starting from that definition and at the level of generality of that definition, we give a mathematical formulation of some of the basic constructions one makes with structural operational semantics. In particular, given a single-step operational semantics, as is the spirit of their work, one composes transitions and considers streams of transitions in order to study the dynamics induced by the operational semantics. In all their leading examples, it is obvious that one can do that and it is obvious how to do it. But if their definition is to be taken seriously, one needs to be able to make such constructions at the level of generality of their definition rather than case-by-case. So this paper does so for several of the basic constructions associated with structural operational semantics, in particular those required in order to speak of a stream of transitions and hence of dynamics.

[1]  Reiko Heckel,et al.  From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence , 1999, CMCS.

[2]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[3]  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.

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

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

[6]  Jirí Adámek,et al.  On the Greatest Fixed Point of a Set Functor , 1995, Theor. Comput. Sci..

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

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

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

[10]  B. Jacobs,et al.  A tutorial on (co)algebras and (co)induction , 1997 .

[11]  Daniele Turi,et al.  Semantics of name and value passing , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

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

[13]  Falk Bartels,et al.  GSOS for Probabilistic Transition Systems , 2002, CMCS.