Almost ASAP semantics: From timed models to timed implementations

Formal Aspects of Computing

Volumn 17, Issue 3, 2005, Pages 319-341

  Wulf, Martin De ^a   Doyen, Laurent ^a   Raskin, Jean François ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Implementability; Semantics; Timed and Hybrid Automata; Verification

Indexed keywords

COMPUTER HARDWARE; CONTROL EQUIPMENT; MATHEMATICAL MODELS;

ASAP SEMANTICS; IMPLEMENTABILITY; TIMED AND HYBRID AUTOMATA; VERIFICATION;

SEMANTICS;

EID: 26844554438     PISSN: 09345043     EISSN: 1433299X     Source Type: Journal    
DOI: 10.1007/s00165-005-0067-8     Document Type: Conference Paper

References (24)

1. [AD94] Alur R, Dill DL (1994) A theory of timed automata. Theor Comp Sci 126(2):183-235
2. [AFILS03] Alur R, Kim J, Ivancic F, Lee I, Sokolsky O (2003) Generating embedded software from hierarchical hybrid models. In: Proceedings of LCTES 2003, vol 38 of ACM SIGPLAN Notices, pp 171-182
3. +02] Amnell T, Fersman E, Mokrushin L, Pettersson P, Yi W (2002) : A tool for modelling and implementation of embedded systems. In: Proceedings of TACAS' 2002, vol 2280 of LNCS, Times Springer, Berlin heidelberg New York, pp 460-464
4. +03] Amnell T, Fersman E, Pettersson P, Sun H, Yi W (2003) Code synthesis for timed automata. Nord J Comput 9(4)
5. [AL91] Abadi M, Lamport, L (1991) The existence of refinement mappings. Theor Comp Sci 82(2):253-284
6. [Ber00] Berry G (2000) The Foundations of Esterel. MIT Press
7. [CBG88] Clarke EM, Browne MC, Grumberg O (1998) Characterizing finite kripke structures in prepositional temporal logic. Theor Comp Sci 59:115-131
8. [CHR02] Cassez F, Henzinger TA, Raskin J-F (2002) A comparison of control problems for timed and hybrid systems. In: Proceedings of HSCC' 02, vol 2289 of LNCS Springer, Berlin Heidelberg, New York pp 134-148
9. [DDMR04] De Wulf M, Doyen L, Markey N, Raskin J-F, (2004) Robustness and implementability of timed automata. In: Proceedings of FORMATS-FTRTFT 2004, vol 3253 of LNCS, Springer, Berlin Heidelberg, New York pp 118-133
10. [DDR04] De Wulf M, Doyen L, Raskin J-F (2004) Almost ASAP semantics: From timed models to timed implementations. In: Proceedings of HSCC' 04, vol 2993 of LNCS, Springer, Berlin Heidelberg, New York pp 296-310
11. [Die01] Dierks H (2001) PLC-automata: a new class of implementable real-time automata. Theor Comput Sci 253(1):61-93
12. [Hen96] Henzinger TA (1996) The theory of hybrid automata. In: Proceedings of LICS '96, IEEE pp 278-292
13. [HHWT95] Henzinger TA, Ho P-H, Wong-Toi H (1995) A user guide to HYTECH. In: Proceedings of TACAS 95, vol 1019 of LNCS Springer, Berlin Heidelberg, New Yorkpp 41-71
14. [HKPV98] Henzinger TA, Kopke PW, Puri A, Varaiya P (1998) What's decidable about hybrid automata? J Comput Sys Sci 57:94-124
15. [HKSP03] Henzinger TA, Kirsch CM, Sanvido MA, Pree W (2003) From control models to real-time code using GIOTTO. IEEE Control Systems Magazine 23(1):50-64
16. [HL02] Hendriks M, Larsen KG (2002) Exact acceleration of real-time model checking. In: Proceedings of TPTS'02, vol 65 of ENTCS. Elsevier Science
17. +00] T. Iversen, K. Kristoffersen, K. Larsen, M. Laursen, R. Madsen, S. Mortensen, P. Petterson, and C. Thomasen. Model-checking real-time control programs - verifying LEGO mindstorms systems using UPPAAL. In Proceedings of ECRTS '00, pages 147-155. IEEE, 2000.
18. [KMTY04] Krčál P, Mokrushin L, Thiagarajan PS, Yi W (2004) Timed vs time triggered automata. In Proceedings of CONCUR'04, vol 3170 of LNCS, Springer, Berlin Heidelberg, New York pp 340-354
19. [LT87] Lynch N, Tuttle M (1987) Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6 th PODC, ACM, pp 137-151
20. [LV04] Lüttgen G, Vogler W (2004) Bisimulation on speed: worst-case efficiency. Information and Computation 191(2):105-144
21. [Mil80] Milner R (1980) A calculus of communicating systems, vol 92 of LNCS, Springer, Berlin Heidelberg, New York
22. [PL00] Pettersson P, Larsen KG (2000) UPPAAL2k. B European Assoc Theor Comp Sci 70:40-44
23. [Pnu77] Pnueli A (1977) The temporal logic of programs. In: Proceedings of FOCS 1977, IEEE, pp 46-57
24. [Wei99] Weispfenning V (1999) Mixed real-integer linear quantifier elimination. In Proceedings of ISSAC 99, ACM, pp 129-136