570 search results - page 1 / 114 » Robustness and Implementability of Timed Automata |
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by ∆ to cope with the reaction delay of the controller. We sh...
107
click to vote
FOSSACS
2008
Springer
15 years 1 months ago
2008
Springer
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...
LICS
2003
IEEE
15 years 4 months ago
2003
IEEE
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 d...
FM
2005
Springer
15 years 5 months ago
2005
Springer
Recently we have proposed the ”almost ASAP” semantics as an alternative semantics for timed automata. This semantics is useful when modeling real-time controllers : control str...
FMSD
2008
14 years 11 months ago
2008
Timed automata are governed by an idealized semantics that assumes a perfectly precise behavior of the clocks. The traditional semantics is not robust because the slightest perturb...