Specifying and proving properties of timed I/O automata using Tempo

Design Automation for Embedded Systems

Volumn 12, Issue 1-2, 2008, Pages 139-170

  Archer, Myla ^a   Lim, Hongping ^b   Lynch, Nancy ^b   Mitra, Sayan ^b   Umeno, Shinya ^b  

^a NAVAL RESEARCH LABORATORY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Automata models; Formal methods; Hybrid systems; Modeling environments; Specification; System development frameworks; Theorem proving; Timed automata; Tool suites; Verification

Indexed keywords

BEHAVIORAL RESEARCH; MODAL ANALYSIS; REAL TIME SYSTEMS; ROBOTS; SPECIFICATIONS; THEOREM PROVING; TIME SHARING SYSTEMS; TRANSLATION (LANGUAGES);

(PL) PROPERTIES; CODE GENERATORS; CONTINUOUS DYNAMICS; DISTRIBUTED SYSTEMS; GENERAL (CO); I/O AUTOMATA; MATHEMATICAL FRAMEWORKS; PHYSICAL PROCESSES; REAL-TIME SOFTWARES; SPRINGER (CO); SUPPORTING SYSTEMS; SYSTEM PROPERTIES; TIMED AUTOMATA (TA); TIMED SYSTEMS; TIMING PROPERTIES; TOOL SETS;

MODEL CHECKING;

EID: 47949106306     PISSN: 09295585     EISSN: 15728080     Source Type: Journal    
DOI: 10.1007/s10617-008-9022-2     Document Type: Conference Paper

References (38)

1. Alur R (1999) Timed automata. In: Proceedings of the 11th international conference on computer aided verification (CAV '99). Lecture notes in computer science, vol 1633. Springer, Berlin, pp 8-22
2. Alur R, Dill DL (1994) A theory of timed automata. Theor Comput Sci 126:183-235
3. Archer M (2000) TAME: Using PVS strategies for special-purpose theorem proving. Ann Math Artif Intell 29(1-4):139-181
4. Archer M (2006) Basing a modeling environment on a general purpose theorem prover. Technical report NRL/MR/5546-06-8952, NRL, Washington, DC, December 2006. Presented at the Monterey Workshop on Software Engineering Tools: Compatibility and Integration, Baden, Austria, October 2004
5. Archer M, Heitmeyer C, Riccobene E (2002) Proving invariants of I/O automata with TAME. Autom Softw Eng 9(3):201-232
6. Archer M, Lim H, Lynch N, Mitra S, Umeno S (2006) Specifying and proving properties of timed I/O automata in the TIOA toolkit. In: Formal methods and models for codesign (MEMOCODE 2006), pp 129-138
7. Bogdanov A, Garland S, Lynch N (2002) Mechanical translation of I/O automaton specifications into first-order logic. In: Formal techniques for networked and distributed systems-FORTE 2002: 22nd IFIP WG 6.1 international conference, Houston, TX, USA, November 2002, pp 364-368
8. Devillers M (1999) Translating IOA automata to PVS. Technical report CSI-R9903, Computing Science Institute, University of Nijmegen, February 1999
9. Dowek G, Muñoz C, Carreño V (2004) Abstract model of the SATS concept of operations: Initial results and recommendations. Technical report NASA/TM-2004-213006, NASA Langley Research Center, Hampton, VA
10. Garland S (2006) TIOA user guide and reference manual. Technical report, MIT CSAIL, Cambridge, MA. URL http://tioa.csail.mit.edu
11. Garland S, Guttag J (1991). A guide to LP, the Larch prover. Technical report, DEC Systems Research Center. URL http://nms.lcs.mit.edu/Larch/LP
12. Garland S, Lynch N, Tauber J, Viziri M (2004) IOA user guide and reference manual. Technical report MIT-LCS-TR-961, MIT CSAIL, Cambridge, MA
13. Gebremichael B, Vaandrager FW (2005) Specifying urgency in timed I/O automata. In: Proceedings of the 3rd IEEE international conference on software engineering and formal methods (SEFM 2005). Koblenz, Germany, 5-9 September 2005. IEEE Computer Society, Los Alamitos, pp 64-73
14. Griffeth N, Cantor Y, Djouvas C (2006) Testing a network by inferring rerpresentative state machines from network traces. In: Proceedings of the international conference on software engineering advances 2006. IEEE Computer Society, Los Alamitos
15. Heitmeyer C, Archer M, Bharadwaj R, Jeffords R (2005) Tools for constructing requirements specifications: the SCR toolset at the age of ten. Int J Comput Syst Sci Eng 20(1):19-35
16. Kaynar D, Lynch NA, Segala R, Vaandrager F (2003) A mathematical framework for modeling and analyzing real-time systems. In: The 24th IEEE international real-time systems symposium (RTSS), Cancun, Mexico, December 2003
17. Kaynar D, Lynch NA, Segala R, Vaandrager F (2005) The theory of timed I/O automata. In: Synthesis lectures on computer science. Morgan Claypool
18. Larsen KG, Pettersson P, Yi W (1997) UPPAAL in a nutshell. Int J Soft Tools Tech Transf 1(1-2):134-152
19. Lim H (2006) Translating timed I/O automata specifications for theorem proving in PVS. Master's thesis, Mass Inst of Tech, Cambridge, MA. URL http://tioa.csail.mit.edu/
20. Lim H, Archer M (2006) Translation templates to support strategy development in PVS. In: Proceedings of the 6th international workshop on strategies in automated deduction (STRATEGIES06), Seattle, USA, August 2006
21. Lim H, Archer M (2007) Translation templates to support strategy development in PVS. Electron Notes Theor Comput Sci 174(1):59-79
22. Lim H, Kaynar D, Lynch N, Mitra S (2005) Translating timed I/O automata specifications for theorem proving in PVS. In: Formal modeling and analysis of timed systems (FORMATS), Uppsala, Sweden, September 2005, pp 17-31
23. Luchangco V (1996) Personal communication. MTT Computer Science Laboratory
24. Lynch N, Tuttle M (1989) An introduction to input/output automata. CWI-Quarterly 2(3):219-246
25. Lynch N, Vaandrager F (1996) Forward and backward simulations, part II: timing-based systems. Inf Comput 128(1):1-25
26. Lynch NA (1996) Distributed algorithms. Morgan Kaufmann, San Mateo
27. Lynch NA, Garland SJ, Kaynar D, Michel L, Shvartsman A (2007) The Tempo language user guide and reference manual. Technical report, MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA, October 2007. URL http://www.veromodo.com/tempo
28. Mavromattis PP (2006) TIOA simulator manual. February 15, 2006. URL http://tioa.csail.mit.edu/public/Tools/simulator/
29. Merritt M, Modugno F, Tuttle MR (1991) Time constrained automata. In: Baeten JCM, Goote JF (eds) CONCUR'91: 2nd international conference on concurrency theory. Lecture notes in computer science, vol 527. Springer, Berlin
30. Mitra S, Archer M (2005) PVS strategies for proving abstraction properties of automata. Electron Notes Theor Comput Sci 152(2):45-65
31. Muñoz C, Carreño V, Dowek G (2006) Formal analysis of the operational concept for the small aircraft transportation system. In: Rigorous engineering of fault-tolerant systems. Lecture notes in computer science, vol 4157. Springer, Berlin, pp 306-325
32. Muñoz C, Dowek G (2005) Hybrid verification of an air traffic operational concept. In: Proceedings of IEEE ISoLA workshop on leveraging applications of formal methods, verification, and validation, Columbia, MD
33. Paulson LC (1994) In: Isabelle: a generic theorem prover. Lecture notes in computer science, vol 828. Springer, Berlin
34. Shankar N, Owre S, Rushby JM, Stringer-Calvert DWJ (2001) PVS Prover Guide, Version 2.4. Technical report, Comp Sci Lab, SRI Int, Menlo Park, CA, November 2001
35. Umeno S (2006) Proving safety properties of an aircraft landing protocol using timed and untimed I/O automata: a case study. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA
36. Umeno S, Lynch N. Proving safety properties of an aircraft landing protocol using I/O automata and the PVS theorem prover: a case study (submitted); long version to appear as an MIT Technical report
37. VeroModo (2006) TIOA model checker user guide and reference manual. 30 August 2006. URL http://www.veromodo.com
38. Win TN (2003) Theorem-proving distributed algorithms with dynamic analysis. Master's thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May 2003