Advertisement

Translating Timed I/O Automata Specifications for Theorem Proving in PVS

  • Hongping Lim
  • Dilsun Kaynar
  • Nancy Lynch
  • Sayan Mitra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3829)

Abstract

Timed Input/Output Automaton (TIOA) is a mathematical framework for specification and analysis of systems that involve discrete and continuous evolution. In order to employ an interactive theorem prover in deducing properties of a TIOA, its state-transition based description has to be translated to the language of the theorem prover. In this paper, we describe a tool for translating TIOA to the language of the Prototype Verification System (PVS)—a specification system with an integrated interactive theorem prover. We describe the translation scheme, discuss the design decisions, and briefly present three case studies to illustrate the application of the translator in the verification process.

Keywords

Theorem Prover Reachable State Forward Simulation Dynamic Type Simulation Relation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kaynar, D., Lynch, N., Segala, R., Vaandrager, F.: Timed I/O automata: A mathematical framework for modeling and analyzing real-time systems. In: RTSS 2003: The 24th IEEE International Real-Time Systems Symposium, Cancun, Mexico (2003)Google Scholar
  2. 2.
    Kaynar, D., Lynch, N., Segala, R., Vaandrager, F.: The theory of timed I/O automata. Technical Report MIT/LCS/TR-917, MIT Laboratory for Computer Science (2003), Available at http://theory.lcs.mit.edu/tds/reflist.html
  3. 3.
    Kaynar, D., Lynch, N., Mitra, S., Garland, S.: TIOA Language. MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA (2005)Google Scholar
  4. 4.
    Kaynar, D., Lynch, N., Mitra, S.: Specifying and proving timing properties with tioa tools. In: Work in progress session of the 25th IEEE International Real-Time Systems Symposium (RTSS 2004), Lisbon, Portugal (2004)Google Scholar
  5. 5.
    Garland, S., Lynch, N., Tauber, J., Vaziri, M.: IOA User Guide and Reference Manual. MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA (2003), Available at http://theory.lcs.mit.edu/tds/ioa.html
  6. 6.
    Owre, S., Rajan, S., Rushby, J., Shankar, N., Srivas, M.: PVS: Combining specification, proof checking, and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 411–414. Springer, Heidelberg (1996)Google Scholar
  7. 7.
    Archer, M.: TAME: PVS Strategies for special purpose theorem proving. Annals of Mathematics and Artificial Intelligence 29 (2001)Google Scholar
  8. 8.
    Owre, S., Rushby, J., Shankar, N., Stringer-Calvert, D.: PVS: an experience report. In: Hutter, D., Traverso, P. (eds.) FM-Trends 1998. LNCS, vol. 1641, pp. 338–345. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  9. 9.
    Bogdanov, A., Garland, S., Lynch, N.: Mechanical translation of I/O automaton specifications into first-order logic. In: Peled, D.A., Vardi, M.Y. (eds.) FORTE 2002. LNCS, vol. 2529, pp. 364–368. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  10. 10.
    Garland, S.J., Guttag, J.V.: A guide to LP, the Larch prover. Technical report, DEC Systems Research Center (1991), Available at http://nms.lcs.mit.edu/Larch/LP
  11. 11.
    Devillers, M.: Translating IOA automata to PVS. Technical Report CSI-R9903, Computing Science Institute, University of Nijmegen (1999), Available at http://www.cs.ru.nl/research/reports/info/CSI-R9903.html
  12. 12.
    Ne Win, T.: Theorem-proving distributed algorithms with dynamic analysis. Master’s thesis, Massachusetts Institute of Technology, Cambridge, MA (2003)Google Scholar
  13. 13.
    Paulson, L.C.: The Isabelle reference manual. Technical Report 283, University of Cambridge (1993)Google Scholar
  14. 14.
    Merritt, M., Tuttle, M.R.: Time-constrained automata. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol. 527. Springer, Heidelberg (1991)Google Scholar
  15. 15.
    Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)MATHGoogle Scholar
  16. 16.
    Lynch, N., Segala, R., Vaandrager, F.: Hybrid I/O automata. Information and Computation 185, 105–157 (2003)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Bogdanov, A.: Formal verification of simulations between I/O automata. Master’s thesis, Massachusetts Institute of Technology, Cambridge, MA (2000), Available at http://theory.lcs.mit.edu/tds/ioa.html
  18. 18.
    Mitra, S., Archer, M.: Reusable PVS proof strategies for proving abstraction properties of I/O automata. In: STRATEGIES 2004, IJCAR Workshop on strategies in automated deduction, Cork, Ireland (2004)Google Scholar
  19. 19.
    Muñoz, C., Mayero, M.: Real automation in the field. Technical Report NASA/CR-2001-211271 Interim ICASE Report No. 39, ICASE-NASA Langley, ICASE Mail Stop 132C, NASA Langley Research Center, Hampton VA 23681-2199, USA (2001)Google Scholar
  20. 20.
    Vito, B.: A PVS prover strategy package for common manipulations (2003), Available at http://shemesh.larc.nasa.gov/people/bld/manip.html
  21. 21.
    Mitra, S., Archer, M.: PVS strategies for proving abstraction properties of automata. Electronic Notes in Theoretical Computer Science 125, 45–65 (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Hongping Lim
    • 1
  • Dilsun Kaynar
    • 1
  • Nancy Lynch
    • 1
  • Sayan Mitra
    • 1
  1. 1.Computer Science and Artificial Intelligence LaboratoryMassachusetts Institute of TechnologyCambridgeUSA

Personalised recommendations