Translating timed i/o automata specifications for theorem proving in PVS

Authors:
Hongping Lim;Dilsun Kaynar;Nancy Lynch;Sayan Mitra
Affiliations:
Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA;Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA
Venue:
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Year:
2005

Citing 9
Cited 3

Distributed Algorithms

Distributed Algorithms
TAME: Using PVS strategies for special-purpose theorem proving

Annals of Mathematics and Artificial Intelligence
Mechanical Translation of I/O Automaton Specifications into First-Order Logic

FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Time-Constrained Automata (Extended Abstract)

CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
PVS: Combining Specification, Proof Checking, and Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
PVS: An Experience Report

FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Hybrid I/O automata

Information and Computation
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
PVS Strategies for Proving Abstraction Properties of Automata

Electronic Notes in Theoretical Computer Science (ENTCS)

Convergence Verification: From Shared Memory to Partially Synchronous Systems

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
A Formalized Theory for Verifying Stability and Convergence of Automata in PVS

TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Parametrized Verification of Distributed Cyber-Physical Systems: An Aircraft Landing Protocol Case Study

ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems

Quantified Score

Hi-index	0.00

Visualization

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.