Name
Abstract | ||
|---|---|---|
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal logics in the literature, including MTL. We make use of this characterization to show that MTL+Past satisfies an "ultimate stability" property with respect to periodic sequences of timed words. Our results hold for both the pointwise and continuous semantics. Along the way we generalize the result of McNaughton-Papert to show a counter-free automata characterization of FO-definable finitely varying functions. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-75454-1_8 | FORMATS |
Keywords | Field | DocType |
languages definable,temporal logic,continuous semantics,counter-free automata characterization,past satisfies,counter-free input-determined automaton,ultimate stability,fo-definable finitely varying function,periodic sequence,satisfiability | Discrete mathematics,Computer science,Automaton,Theoretical computer science,Timed automaton,Temporal logic,Regular language,Periodic sequence,Periodic graph (geometry),Semantics,Pointwise | Conference |
Volume | ISSN | ISBN |
4763 | 0302-9743 | 3-540-75453-9 |
Citations | PageRank | References |
3 | 0.37 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabrice Chevalier | 1 | 126 | 7.32 |
| Deepak D'souza | 2 | 239 | 17.90 |
| Pavithra Prabhakar | 3 | 219 | 25.69 |