From Timed Automata to Logic - and Back
DOI:
https://doi.org/10.7146/brics.v2i2.19504Resumé
One of the most successful techniques for automatic verification is thatof 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.
Downloads
Publiceret
1995-01-02
Citation/Eksport
Laroussinie, F., Larsen, K. G., & Weise, C. (1995). From Timed Automata to Logic - and Back. BRICS Report Series, 2(2). https://doi.org/10.7146/brics.v2i2.19504
Nummer
Sektion
Artikler
Licens
Authors who publish with this journal agree to the following terms:- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).