Abstract
In this paper, we introduce a parametric semantics for timed controllers called the Almost ASAP semantics. This semantics is a relaxation of the usual ASAP semantics (also called the maximal progress semantics) which is a mathematical idealization that can not 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, show how it can be analyzed using the tool HYTECH, and illustrate its practical use on examples. © Springer-Verlag 2004.
Cite
CITATION STYLE
De Wulf, M., Doyen, L., & Raskin, J. F. (2004). Almost ASAP semantics: Prom timed models to timed implementations. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2993, 296–310. https://doi.org/10.1007/978-3-540-24743-2_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
