Almost ASAP semantics: from timed models to timed implementations
Martin Wulf, Laurent Doyen, Jean-François Raskin · Formal Aspects of Computing · 2005
Abstract In this paper, we introduce a parametric semantics for timed controllers called theAlmostASAP (as soon as possible) semantics. This semantics is a relaxation of the usual ASAP semantics (also called themaximal 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.