2
Download:
|
|
by Vineet Gupta, Thomas A. Henzinger, Radha Jagadeesan
http://www.math.luc.edu/~radha/ftp/robust.ps.gz
Add To MetaCart
Abstract:
Abstract. We define robust timed automata, which are timed automata that accept all trajectories "robustly": if a robust timed automaton accepts a trajectory, then it must accept neighboring trajectories also; and if a robust timed automaton rejects a trajectory, then it must reject neighboring trajectories also. We show that the emptiness problem for robust timed automata is still decidable, by modifying the region construction for timed automata. We then show that, like timed automata, robust timed automata cannot be determinized. This result is somewhat unexpected, given that in temporal logic, the removal of realtime equality constraints is known to lead to a decidable theory that is closed under all boolean operations. 1
Citations
| 1421 | The theory of timed automata – Alur, Dill - 1991 |
| 444 | Symbolic model checking for real-time systems – Henzinger, Nicollin, et al. - 1994 |
| 300 | Hybrid automata: an algorithmic approach to the specification and verification of hybrid systems – Alur, Courcoubetis, et al. - 1993 |
| 279 | The theory of hybrid automata – Henzinger - 1996 |
| 227 | Automatic symbolic verification of embeded systems – Alur, Henzinger, et al. - 1996 |
| 142 | The benefits of relaxing punctuality – Alur, Feder, et al. - 1996 |
| 110 | HyTech: the next generation – Henzinger, Ho, et al. - 1995 |
| 99 | Model-checking in dense real time – Alur, Courcoibetis, et al. - 1993 |
| 41 | A determinizable class of timed automata – Alur, Fix, et al. |
