From Timed Automata to Logic - and Back
AbstractOne of the most successful techniques for automatic verification is that
of model checking. For finite automata there exist since long extremely
efficient model-checking algorithms, and in the last few years these algorithms have been made applicable to the verification of real-time automata using the region-techniques of Alur and Dill.
In this paper, we continue this transfer of existing techniques from the
setting of finite (untimed) automata to that of timed automata. In particular, a timed logic L is put forward, which is sufficiently expressive that we for any timed automaton may construct a single characteristic L formula uniquely characterizing the automaton up to timed bisimilarity. Also, we prove decidability of the satisfiability problem for L with respect to given bounds on the number of clocks and constants of the timed automata to be constructed. None of these results have as yet been succesfully accounted for in the presence of time.
How to Cite
Laroussinie, F., Larsen, K., & Weise, C. (1995). From Timed Automata to Logic - and Back. BRICS Report Series, 2(2). https://doi.org/10.7146/brics.v2i2.19504
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.