Available as:
Abstract:
We give an abstract axiomatic account of timed processes using monoids and their (partial and total) actions. Subsequently, we present categorical formulations thereof, including a novel characterisation of partial monoid actions as coalgebras for an evolution comonad. Adapting the approach of Turi and Plotkin, we then exhibit an abstract theory of well-behaved operational rules suitable for timed processes and, for discrete time, also derive a concrete syntactic format encompassing all rules we found in the literature.
BibTeX entry:
@InProceedings{Kick02a,
editor = {P.\ Widmayer and F.\ Triguero and R.\ Morales and M.\ Hennessy and S.\ Eidenbenz and R.\ Conejo},
author = {M. Kick},
title = {Bialgebraic Modelling of Timed Processes},
booktitle = {Proceedings ICALP'02},
year = {2002},
series = {Lecture Notes in Computer Science},
volume = {2380},
publisher = {Springer Verlag},
note = {Available from \texttt{http://www.dcs.ed.ac.uk/home/mk}},
}