**Chairs:** C. Cirstea, F. Gadducci, H. Schlingloff
**Past Chairmen:** M. Roggenbach, L. Schröder, T. Mossakowski, J. Fiadeiro, P. Mosses, H.-J. Kreowski

Wed, 11 January 2017 at 03:00 pm in Binz (Rügen), Germany

Joint work with: Antónia Lopes, Benoît Delahaye and Axel Legay

Abstract: We present an algebra of discrete timed input/output automata that may execute in the context of different clock granularities – which we call timed machines; this algebra includes a refinement operator through which a machine can be extended with new states and transitions in order to accommodate a finer clock granularity as required to interoperate with other machines, and an extension of the traditional product of timed input-output automata to the situation in which the granularities of the two machines are not the same. We investigate important properties of timed machines such as consistency – in the sense that a machine can be ensured to generate a non-empty language, and feasibility – in the sense that a machine can be ensured to generate a non-empty language no matter what inputs it receives..

SlidesPaper