(Enter summary)
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... (Update)
Cited by: More
Prototype-Based Tests for Hybrid Reactive Systems - Hahn, Philipps, Pretschner..
(Correct)
Universality and Language Inclusion for Open and Closed.. - Ouaknine, Worrell (2003)
(Correct)
On the Language Inclusion Problem for Timed Automata.. - Ouaknine, Worrell
(Correct)
Similar documents (at the sentence level):
79.0%: Robust Timed Automata - Gupta, Henzinger, Jagadeesan (1997)
(Correct)
13.3%: Robust Undecidability of Timed - And Hybrid Systems
(Correct)
Active bibliography (related documents): More All
0.0: The Regular Real-Time Languages - Henzinger, Raskin, Schobbens (1998)
(Correct)
0.0: Real-time System = Discrete System + Clock Variables - Alur, Henzinger (1997)
(Correct)
0.0: Timed Automata - Alur (1998)
(Correct)
Similar documents based on text: More All
0.4: Models for Concurrent Constraint Programming - Gupta, Jagadeesan, Saraswat (1996)
(Correct)
0.4: Probabilistic Concurrent Constraint Programming - Gupta, Jagadeesan, Saraswat (1997)
(Correct)
0.4: Truly Concurrent Constraint Programming - Gupta, Jagadeesan, Saraswat (1996)
(Correct)
Related documents from co-citation: More All
12: Theoretical Computer Science (context) - Alur, Dill et al. - 1994
8: The theory of hybrid automata
- Henzinger - 1996
8: Timing analysis in cospan
- Alur, Kurshan - 1996
BibTeX entry: (Update)
V. Gupta, T.A. Henzinger, and R. Jagadeesan. Robust timed automata. In O. Maler, editor, Proceedings International Workshop HART'97, volume 1201 of Lecture Notes in Computer Science, pages 331--345. Springer-Verlag, 1997. http://citeseer.ist.psu.edu/article/gupta97robust.html More
@inproceedings{ gupta97robust,
author = "{V. Gupta} and {T. Henzinger} and {R. Jagadeesan}",
title = "Robust Timed Automata",
booktitle = "{H}ybrid and {R}eal-{T}ime {S}ystems",
publisher = "Springer Verlag, LNCS 1201",
address = "Grenoble, France",
editor = "{O. Maler}",
pages = "331--345",
year = "1997",
url = "citeseer.ist.psu.edu/article/gupta97robust.html" }
Citations (may not include all citations):
666
Theoretical Computer Science (context) - Alur, Dill et al. - 1994
404
Symbolic model checking for real-time systems
- Henzinger, Nicollin et al. - 1994
399
The algorithmic analysis of hybrid systems
- Alur, Courcoubetis et al. - 1995
232
Hybrid automata: an algorithmic approach to the specificatio..
- Alur, Courcoubetis et al. - 1993
224
Model checking in dense real time
- Alur, Courcoubetis et al. - 1993
167
Automatic symbolic verification of embedded systems
- Alur, Henzinger et al. - 1996
160
The theory of hybrid automata
- Henzinger - 1996
97
HyTech: the next generation
- Henzinger, Ho et al. - 1995
88
The benefits of relaxing punctuality
- Alur, Feder et al. - 1996
40
A determinizable class of timed automata (context) - Alur, Fix et al. - 1994
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC