Almost ASAP semantics: from timed models to timed implementations

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.

[1]  Nicolas Markey,et al.  Robustness and Implementability of Timed Automata , 2004, FORMATS/FTRTFT.

[2]  Pravin Varaiya,et al.  What's decidable about hybrid automata? , 1995, STOC '95.

[3]  Edmund M. Clarke,et al.  Characterizing Finite Kripke Structures in Propositional Temporal Logic , 1988, Theor. Comput. Sci..

[4]  Gérard Berry,et al.  The foundations of Esterel , 2000, Proof, Language, and Interaction.

[5]  Wang Yi,et al.  Code Synthesis for Timed Automata , 2003 .

[6]  Thomas A. Henzinger,et al.  A User Guide to HyTech , 1995, TACAS.

[7]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[8]  Henning Dierks.  PLC-automata: a new class of implementable real-time automata , 2001, Theor. Comput. Sci..

[9]  Walter Vogler,et al.  Bisimulation on speed: worst-case efficiency , 2004, Inf. Comput..

[10]  Wang Yi,et al.  Timed vs. Time-Triggered Automata , 2004, CONCUR.

[11]  Thomas A. Henzinger,et al.  From control models to real-time code using Giotto , 2003 .

[12]  A. Pnueli,et al.  Effective synthesis of switching controllers for linear systems , 2000, Proceedings of the IEEE.

[13]  Jean-François Raskin,et al.  Almost ASAP semantics: from timed models to timed implementations , 2004, Formal Aspects of Computing.

[14]  Wang Yi,et al.  TIMES - A Tool for Modelling and Implementation of Embedded Systems , 2002, TACAS.

[15]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[16]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[17]  Kim G. Larsen,et al.  Exact Acceleration of Real-Time Model Checking , 2002, Theory and Practice of Timed Systems @ ETAPS.

[18]  Martín Abadi,et al.  The existence of refinement mappings , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[19]  Insup Lee,et al.  Generating embedded software from hierarchical hybrid models , 2003, LCTES '03.

[20]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[21]  Amir Pnueli,et al.  The temporal logic of programs , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[22]  Thomas A. Henzinger,et al.  The theory of hybrid automata , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[23]  Kim Guldstrand Larsen,et al.  Model-Checking Real-Time Control Programs. Verifying LEGO Mindstorms Systems Using UPPAAL , 1999 .

[24]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[25]  Vladimiro Sassone,et al.  Bulletin of the European Association for Theoretical Computer Science , 2005 .

[26]  Thomas A. Henzinger,et al.  A Comparison of Control Problems for Timed and Hybrid Systems , 2002, HSCC.

[27]  Volker Weispfenning,et al.  Mixed real-integer linear quantifier elimination , 1999, ISSAC '99.

[28]  Kim G. Larsen,et al.  Model-checking real-time control programs: verifying LEGO MINDSTORMSTM systems using UPPAAL , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.