Sciweavers

FORMATS
2004
Springer

Robustness and Implementability of Timed Automata

13 years 9 months ago
Robustness and Implementability of Timed Automata
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 showed that this semantics is implementable provided there exists a strictly positive value for the parameter ∆ for which the strategy is correct. In this paper, we define the implementability problem to be the question of existence of such a ∆. We show that this question is closely related to a notion of robustness for timed automata defined in [Pur98] and prove that the implementability problem is decidable.
Martin De Wulf, Laurent Doyen, Nicolas Markey, Jea
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where FORMATS
Authors Martin De Wulf, Laurent Doyen, Nicolas Markey, Jean-François Raskin
Comments (0)