Coalgebraic semantics for timed processes

We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a ''time domain'', and we model processes by ''timed transition systems'', which amount to partial monoid actions of the time domain or, equivalently, coalgebras for an ''evolution comonad'' generated by the time domain. All our examples of time domains satisfy a partial closure property, yielding a distributive law of a monad for total monoid actions over the evolution comonad, and hence a distributive law of the evolution comonad over a dual comonad for total monoid actions. We show that the induced coalgebras are exactly timed transition systems with delay operators. We then integrate our coalgebraic formulation of time qua timed transition systems into Turi and Plotkin's formulation of structural operational semantics in terms of distributive laws. We combine timing with action via the more general study of the combination of two arbitrary sorts of behaviour whose operational semantics may interact. We give a modular account of the operational semantics for a combination induced by that of each of its components. Our study necessitates the investigation of products of comonads. In particular, we characterise when a monad lifts to the category of coalgebras for a product comonad, providing constructions with which one can readily calculate.

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

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

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

[4]  Joseph Sifakis,et al.  An Overview and Synthesis on Timed Process Algebras , 1991, REX Workshop.

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

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

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

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

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

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

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

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

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

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

[15]  F. William Lawvere,et al.  Metric spaces, generalized logic, and closed categories , 1973 .

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

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

[18]  Gordon D. Plotkin,et al.  Combining effects: Sum and tensor , 2006, Theor. Comput. Sci..

[19]  John Power,et al.  Category theory for operational semantics , 2004, Theor. Comput. Sci..

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

[21]  J. Adámek,et al.  Locally Presentable and Accessible Categories: Bibliography , 1994 .

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

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

[24]  John Power,et al.  Modularity of Behaviours for Mathematical Operational Semantics , 2004, CMCS.