Sciweavers

Share
LICS
2003
IEEE

Revisiting Digitization, Robustness, and Decidability for Timed Automata

10 years 1 days ago
Revisiting Digitization, Robustness, and Decidability for Timed Automata
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to discrete time, but are applicable only when the implementation is closed under digitization and the speciļ¬cation is closed under inverse digitization. We show that, for timed automata, the former (whether the implementation is closed under digitization) is decidable, but not the latter. We also investigate digitization questions in connection with the robust semantics for timed automata. The robust modelling approach introduces a timing fuzziness through the semantic removal of equality testing. Since its
Joël Ouaknine, James Worrell
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where LICS
Authors Joël Ouaknine, James Worrell
Comments (0)
books