De Wulf, Martin; Doyen, Laurent; Raskin, Jean-François Almost ASAP semantics: from timed models to timed implementations. (English) Zbl 1101.68670 Formal Asp. Comput. 17, No. 3, 319-341 (2005). Summary: In this paper, we introduce a parametric semantics for timed controllers called the Almost ASAP (As Soon As Possible) semantics. This semantics is a relaxation of the usual ASAP semantics (also called the maximal progress semantics) which is a mathematical idealization that cannot be implemented by any physical device no matter how fast it is. On the contrary, any correct Almost ASAP controller can be implemented by a program on a hardware if this hardware is fast enough. We study the properties of this semantics and show how it can be analyzed using the tool HyTech. Cited in 15 Documents MSC: 68Q55 Semantics in the theory of computing Keywords:Timed and Hybrid Automata; Semantics; Implementability; Verification Software:CUDD; Kronos; PHAVer; Uppaal; Uppaal2k PDF BibTeX XML Cite \textit{M. De Wulf} et al., Formal Asp. Comput. 17, No. 3, 319--341 (2005; Zbl 1101.68670) Full Text: DOI