Specifying and proving properties of timed I/O automata in the TIOA toolkit

Proceedings - Fourth ACM and IEEE International Conference on Formal Methods and Models for Co-Design, MEMOCODE'06

Volumn , Issue , 2006, Pages 129-138

  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

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; REAL TIME SYSTEMS; SPECIFICATIONS;

CONTINUOUS DYNAMICS; SPECIFICATION SIMULATORS; SUPPORTING SYSTEM DEVELOPMENT;

AUTOMATA THEORY;

EID: 40949166046     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. R. Alur. Timed automata. In Proc. 11th Intern. Conf. on Computer Aided Verif. (CAV '99), volume 1633 of Lect. Notes in Comp. Sci., pages 8-22. Springer-Verlag, 1999.
2. R. Alur and D. L. Dill. A theory of timed automata. Theoretical. Computer Science, 126:183-235, 1994.
3. M. Archer. TAME: Using PVS strategies for special-purpose theorem proving. Annals of Mathematics and Artificial Intelligence, 29(1-4):139-181, 2000. Published Feb. 2001.
4. M. Archer. Basing a modeling environment on a general purpose theorem prover. In Proc. Monterey Wkshp. on Soft. Eng. Tools: Compat. and Integr., Baden, Austria, Oct. 2004. To appear.
5. M. Archer, C. Heitmeyer, and E. Riccobene. Proving invariants of I/O automata with TAME. Automated Software Engineering. 9(3):201-232, 2002.
6. A. Bogdanov, S. Garland, and N. Lynch. Mechanical translation of I/O automaton specifications into first-order logic. In Form. Tech.s for Networked and Distr. Sys. - FORTE 2002: 22nd IFIP WG 6.1 Intern. Conf., pages 364-368, Texas, Houston, USA, Nov. 2002.
7. M. Devillers. Translating IOA automata to PVS. Technical Report CSI-R9903, Computing Science Institute, University of Nijmegen, February 1999.
8. G. Dowek, C. Muñoz, and V. Carreño. Abstract model of the SATS concept of operations: Initial results and recommendations. Technical Report NASA/TM-2004-213006, NASA Langley Res. Ctr., Hampton, VA, 2004.
9. S. Garland. TIOA User Guide and Reference Manual. Technical report, MIT CSAIL, Cambridge, MA, 2006.
10. S. Garland and J. Guttag. A guide to LP, the Larch prover. Technical report, DEC Systems Research Center, 1991. URL http://nms.lcs.mit.edu/Larch/LP.
11. S. Garland, N. Lynch, J. Tauber, and M. Viziri. IOA User Guide and Reference Manual. Technical Report MIT-LCS-TR-961, MIT CSAIL, Cambridge, MA, 2004.
12. B. Gebremichael and F. W. Vaandrager. Specifying urgency in timed I/O automata. In Proc. 3rd IEEE Intern. Conf. on Softw. Eng. and Form. Meths. (SEFM 2005), pages 64-73, Koblenz, Germany, September 5-9 2005. IEEE Comp. Soc.
13. N. D. Griffeth and C. Djouvas. Experimental method for testing networks. In Soft. Eng. Research and Practice, pages 935-941, 2005.
14. C. Heitmeyer, M. Archer, R. Bharadwaj, and R. Jeffords. Tools for constructing requirements specifications: The SCR toolset at the age often. Intern. J. on Computer System Science and Engineering, 20(1):19-35, January 2005.
15. D. Kaynar, N. A. Lynch, R. Segala, and F. Vaandrager. A mathematical framework for modeling and analyzing real-time systems. In The 24th IEEE Intern. Real-Time Systems Symposium. (RTSS), Cancun, Mexico, December 2003.
16. D. Kaynar, N. A. Lynch, R. Segala, and F. Vaandrager. The Theory of Timed I/O automata. Synthesis Lectures on Computer Science-Morgan Claypool Publishers, 2005.
17. K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. Intern. J. on Software Tools for Tech. Transfer, 1(1-2):134-152, 1997.
18. H. Lim. Translating timed I/O automata specifications for theorem proving in PVS. Master's thesis, MIT, Cambridge, MA, 2006.
19. H. Lim and M. Archer. Translation templates to support strategy development in PVS. In STRATEGIES06, 6th International Workshop on Strategies in Automated Deduction, Seattle, USA, August 2006.
20. H. Lim, D. Kaynar, N. Lynch, and S. Mitra. Translating timed I/O automata specifications for theorem proving in PVS. In Formal Modeling and Analysis of Timed Systems (FORMATS), pages 17-31, Uppsala, Sweden, Sept. 2005.
21. V. Luchangco. Personal communication. 1996.
22. N. Lynch and M. Tuttle. An introduction to Input/Output automata. CWI-Quarterly, 2(3):219-246, Sept. 1989. Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands.
23. N. Lynch and F. Vaandrager. Forward and backward simulations - Part II: Timing-based systems. Information, and Computation, 128(1):1-25, July 1996.
24. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., 1996.
25. M. Merritt, F. Modugno, and M. R. Tuttle. Time constrained automata. In J. C. M. Baeten and J. F. Goote, eds., CONCUR'91: 2nd Intern. Conference on Concurrency Theory, vol. 527 of Lect. Notes in Comp. Sci. Springer-Verlag, 1991.
26. S. Mitra and M. Archer. PVS strategies for proving abstraction properties of automata. Electronic Notes in Theor. Comp. Sci., 125(2):45-65, 2005.
27. L. C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lect. Notes in Comp. Sci. Springer-Verlag, 1994.
28. N. Shankar, S. Owre, J. M. Rushby, and D. W. J. Stringer-Calvert. PVS Prover Guide, Version 2.4. Technical report, Comp. Sci. Lab., SRI Intl., Menlo Park, CA, Nov. 2001.
29. S. Umeno and N. Lynch. Proving safety properties of an aircraft landing protocol using I/O Automata and the PVS theorem prover: A case study. To appear as an MIT Technical Report.
30. T. N. Win. Theorem-proving distributed algorithms with dynamic analysis. Master's thesis, MIT Dept. of Electr. Eng. and Comp. Sci., May 2003.