Abstract
This paper presents an assertional-style verification of the aircraft landing protocol of NASA's SATS (Small Aircraft Transportation System) concept [1] using the I/O automata framework and the PVS theorem prover. We reconstructed the mathematical model of the landing protocol presented in [2] as an I/O automaton. In addition, we translated the I/O automaton into a corresponding PVS specification, and conducted a verification of the safety properties of the protocol using the assertional proof technique and the PVS theorem prover. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Umeno, S., & Lynch, N. (2006). Proving safety properties of an aircraft landing protocol using I/O automata and the PVS theorem prover: A case study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4085 LNCS, pp. 64–80). Springer Verlag. https://doi.org/10.1007/11813040_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
