Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary and short version of this paper appeared in the Proceedings of the 7th International Workshop on Hybrid Systems: Computation and Control (HSCC 2004), Lecture Notes in Computer Science, vol 2993, pp 296–310. This work was supported by the FRFC project ``Centre Fédéré en Vérification'' funded by the Belgian National Science Fundation (FNRS) under grant nr 2.4530.02.
Research fellow supported by the Belgian National Science Fundation (FNRS).
Received November 2004
Revised April 2005 and May 2005
Accepted May 2005 by M. J. Butler
Rights and permissions
About this article
Cite this article
Wulf, M., Doyen, L. & Raskin, JF. Almost ASAP semantics: from timed models to timed implementations. Form Asp Comp 17, 319–341 (2005). https://doi.org/10.1007/s00165-005-0067-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-005-0067-8