Name
Abstract | ||
|---|---|---|
We consider a general class of timed automata parameterized by a set of “input-determined” operators, in a continuous time setting. We show that for any such set of operators, we have a monadic second order logic characterization of the class of timed languages accepted by the corresponding class of automata. Further, we consider natural timed temporal logics based on these operators, and show that they are expressively equivalent to the first-order fragment of the corresponding MSO logics. As a corollary of these general results we obtain an expressive completeness result for the continuous version of MTL. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11944836_34 | FSTTCS |
Keywords | Field | DocType |
first-order fragment,order logic characterization,continuous version,expressive completeness result,expressively equivalent,continuous time setting,input-determined guard,general result,corresponding mso logic,general class,corresponding class,temporal logic | Discrete mathematics,Parameterized complexity,Second-order logic,Computer science,Automaton,Timed automaton,Operator (computer programming),Temporal logic,Completeness (statistics),Monadic predicate calculus | Conference |
Volume | ISSN | ISBN |
4337 | 0302-9743 | 3-540-49994-6 |
Citations | PageRank | References |
4 | 0.41 | 13 |
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 |