Proving Safety Properties of an Aircraft Landing Protocol Using I/O Automata and the PVS Theorem Prover: A Case Study
- Cite this paper as:
- 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: Misra J., Nipkow T., Sekerinski E. (eds) FM 2006: Formal Methods. FM 2006. Lecture Notes in Computer Science, vol 4085. Springer, Berlin, Heidelberg
This paper presents an assertional-style verification of the aircraft landing protocol of NASA’s SATS (Small Aircraft Transportation System) concept  using the I/O automata framework and the PVS theorem prover. We reconstructed the mathematical model of the landing protocol presented in  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.
Unable to display preview. Download preview PDF.