Almost ASAP semantics: from timed models to timed implementations-Reference-Cited by-同舟云学术

Almost ASAP semantics: from timed models to timed implementations

Published:2005-10 Issue:3 Volume:17 Page:319-341
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Wulf Martin De¹,Doyen Laurent¹,Raskin Jean-François¹

Affiliation:

1. Computer Science Department, Université Libre de Bruxelles, Boulevard du Triomphe CP 212, B-1050, Brussels, Belgium

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00165-005-0067-8.pdf

Reference24 articles.

1. A theory of timed automata;Alur R;Theor Comp Sci,1994

2. The existence of refinement mappings;Abadi M;Theor Comp Sci,1991

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Implementable Timed Automata;Formal Techniques for Distributed Objects, Components, and Systems;2020

2. Verification of Hybrid Systems;Handbook of Model Checking;2018

3. Robust Model Checking of Timed Automata under Clock Drifts;Proceedings of the 20th International Conference on Hybrid Systems: Computation and Control;2017-04-13

4. On Global Scheduling Independency in Networks of Timed Automata;Lecture Notes in Computer Science;2017

5. Entropy of regular timed languages;Information and Computation;2015-04