Since 2014
From Timed Automata to Logic - and Back
BRICS Report Series
View Archive Info| Field | Value | |
| Title |
From Timed Automata to Logic - and Back
|
|
| Creator |
Laroussinie, Francois
Larsen, Kim G. Weise, Carsten |
|
| Description |
One of the most successful techniques for automatic verification is thatof model checking. For finite automata there exist since long extremelyefficient 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 thesetting 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.
|
|
| Publisher |
Aarhus University
|
|
| Contributor |
—
|
|
| Date |
1995-01-02
|
|
| Type |
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion — |
|
| Format |
application/pdf
|
|
| Identifier |
https://tidsskrift.dk/brics/article/view/19504
10.7146/brics.v2i2.19504 |
|
| Source |
BRICS Report Series; No 2 (1995): RS-02 From Timed Automata to Logic and Back
BRICS Report Series; No 2 (1995): RS-02 From Timed Automata to Logic and Back 1601-5355 0909-0878 |
|
| Language |
eng
|
|
| Relation |
https://tidsskrift.dk/brics/article/view/19504/17126
|
|
| Rights |
Copyright (c) 2014 BRICS Report Series
|
|