Formal testing for separation assurance

14Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In order to address the rapidly increasing load of air traffic operations, innovative algorithms and software systems must be developed for the next generation air traffic control. Extensive verification of such novel algorithms is key for their adoption by industry. Separation assurance algorithms aim at predicting if two aircraft will get closer to each other than a minimum safe distance; if loss of separation is predicted, they also propose a change of course for the aircraft to resolve this potential conflict. In this paper, we report on our work towards developing an advanced testing framework for separation assurance. Our framework supports automated test case generation and testing, and defines test oracles that capture algorithm requirements. We discuss three different approaches to test-case generation, their application to a separation assurance prototype, and their respective strengths and weaknesses. We also present an approach for statistical analysis of the large numbers of test results obtained from our framework. © 2011 Springer Science+Business Media B.V.

Cite

CITATION STYLE

APA

Giannakopoulou, D., Bushnell, D. H., Schumann, J., Erzberger, H., & Heere, K. (2011). Formal testing for separation assurance. Annals of Mathematics and Artificial Intelligence, 63(1), 5–30. https://doi.org/10.1007/s10472-011-9224-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free