zbMATH — the first resource for mathematics

Implementation of timed automata: An issue of semantics or modeling? (English) Zbl 1175.68240
Pettersson, Paul (ed.) et al., Formal modeling and analysis of timed systems. Third international conference, FORMATS 2005, Uppsala, Sweden, September 26–28, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30946-2/pbk). Lecture Notes in Computer Science 3829, 273-288 (2005).
Summary: We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We propose an implementation methodology which allows to transform a timed automaton into a program and to check whether the execution of this program on a given platform satisfies a desired property. This is done by modeling the program and the execution platform, respectively, as an untimed automaton and a collection of timed automata. We also study the problem of property preservation, in particular when moving to a “better” execution platform. We show that some subtleties arise regarding the definition of “better”, in particular for digital clocks. The fundamental issue is that faster clocks result in better “sampling” and therefore can introduce more behaviors.
For the entire collection see [Zbl 1097.68008].

68Q45 Formal languages and automata
Giotto; Uppaal
Full Text: DOI