Name
Abstract | ||
|---|---|---|
We study the class of timed automata called eventual timed automata (ETA’s) obtained using guards based on the operator
\Diamond\Diamond. In this paper we show that ETA’s form a decidable class of timed automata via a flattening to non-recursive ETA’s followed
by a reduction to 1-clock alternating timed automata. We also study the expressiveness of the class of ETA’s and show that
they compare favourably with other classes in the literature. Finally we show that class obtained using the dual operator
\Diamond-</font
>\Diamond\!\!\!\!\!- is also decidable, though the two operators together lead to an undecidable class of languages.
|
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11590156_26 | Foundations of Software Technology and Theoretical Computer Science |
Keywords | Field | DocType |
undecidable class,dual operator,decidable class | Discrete mathematics,Combinatorics,Computer science,Automaton,Decidability,Timed automaton,Operator (computer programming),Temporal logic,Expressivity,Undecidable problem | Conference |
Volume | ISSN | ISBN |
3821 | 0302-9743 | 3-540-30495-9 |
Citations | PageRank | References |
2 | 0.39 | 9 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deepak D’Souza | 1 | 55 | 3.25 |
| M. Raj Mohan | 2 | 4 | 1.49 |