A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Robustness and Implementability of Timed Automata
[chapter]
2004
Lecture Notes in Computer Science
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
doi:10.1007/978-3-540-30206-3_10
fatcat:4cuiz33ur5dabbzeaqomdgj3gq