Name
Abstract | ||
|---|---|---|
In this paper we study conciseness of various extensions of timed automata, and prove that several features like diagonal constraints or updates lead to exponentially more concise timed models. |
Year | Venue | Keywords |
|---|---|---|
2005 | Journal of Automata, Languages and Combinatorics | updates,timed automata,conciseness,diagonal constraint,diagonal constraints,various extension |
Field | DocType | Volume |
Diagonal,Discrete mathematics,Automaton,Theoretical computer science,Timed automaton,Artificial intelligence,Mathematics | Journal | 10 |
Issue | Citations | PageRank |
4 | 16 | 0.84 |
References | Authors | |
17 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patricia Bouyer | 1 | 16 | 0.84 |
| Fabrice Chevalier | 2 | 126 | 7.32 |