@inproceedings{10.1007/978-3-540-30206-3_10,
Abstract = {In a former paper, we defined a new semantics for timed automata, the Almost ASAP semantics, which is parameterized by $\Delta$ 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 $\Delta$ for which the strategy is correct. In this paper, we define the implementability problem to be the question of existence of such a $\Delta$. 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.},
Address = {Berlin, Heidelberg},
Author = {De Wulf, Martin and Doyen, Laurent and Markey, Nicolas and Raskin, Jean-Fran{\c{c}}ois},
BookTitle = {Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems},
Editor = {Lakhnech, Yassine and Yovine, Sergio},
File = {Robustness and Implementability of Timed Automata - DDMR-formats2004 - a - a - a - b.pdf},
ISBN = {978-3-540-30206-3},
Pages = {118--133},
Publisher = {Springer Berlin Heidelberg},
Title = {Robustness and Implementability of Timed Automata},
Year = {2004},
date-added = {2020-01-06 16:05:35 +0100},
date-modified = {2020-01-06 16:05:35 +0100},
doi = {10.1007/978-3-540-30206-3_10}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A