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.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- Robustness and Implementability of Timed Automata
Martin De Wulf
- Springer Berlin Heidelberg
Neuer Inhalt/© ITandMEDIA