Arrow Research search
Back to I&C

I&C 2006

Coalgebraic semantics for timed processes

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

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.

Authors

Keywords

  • Time domains
  • Timed transition systems
  • Evolution comonads
  • Delay operators
  • Structural operational semantics
  • Modularity
  • Distributive laws

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
91748518087617953
v2026.09.13