Gupta, Vineet; Henzinger, Thomas AISTA ; Jagadeesan, Radha
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.
The first and third author were supported in part by grants from ARPA and ONR. The second author was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the AFOSR contract F49620-93-1-0056, by the ARO MURI grant DAAH-04-96-1-0341, by the ARPA grant NAG2-892, and by the SRC contract 95-DC-324.036. The third author was also supported by the NSF.
331 - 345
HART: Hybrid and Real-Time Systems
Gupta V, Henzinger TA, Jagadeesan R. Robust timed automata. In: Vol 1201. Springer; 1997:331-345. doi:10.1007/BFb0014736
Gupta, V., Henzinger, T. A., & Jagadeesan, R. (1997). Robust timed automata (Vol. 1201, pp. 331–345). Presented at the HART: Hybrid and Real-Time Systems, Springer. https://doi.org/10.1007/BFb0014736
Gupta, Vineet, Thomas A Henzinger, and Radha Jagadeesan. “Robust Timed Automata,” 1201:331–45. Springer, 1997. https://doi.org/10.1007/BFb0014736.
V. Gupta, T. A. Henzinger, and R. Jagadeesan, “Robust timed automata,” presented at the HART: Hybrid and Real-Time Systems, 1997, vol. 1201, pp. 331–345.
Gupta V, Henzinger TA, Jagadeesan R. 1997. Robust timed automata. HART: Hybrid and Real-Time Systems, LNCS, vol. 1201, 331–345.
Gupta, Vineet, et al. Robust Timed Automata. Vol. 1201, Springer, 1997, pp. 331–45, doi:10.1007/BFb0014736.