• Title of article

    Provably correct conflict prevention bands algorithms

  • Author/Authors

    Anthony Narkawicz، نويسنده , , César Mu?oz، نويسنده , , Gilles Dowek، نويسنده ,

  • Issue Information
    دوهفته نامه با شماره پیاپی سال 2012
  • Pages
    19
  • From page
    1039
  • To page
    1057
  • Abstract
    In air traffic management, a pairwise conflict is a predicted loss of separation between two aircraft, referred to as the ownship and the intruder. A conflict prevention bands system displays ranges of maneuvers for the ownship that characterize regions in the airspace that are either conflict-free or “don’t go” zones that the ownship has to avoid. Errors in the calculation of prevention bands may result in incorrect separation assurance information being displayed to pilots or air traffic controllers. Algorithms that compute conflict prevention bands are surprisingly difficult to formalize and verify. This paper presents a method for the analysis and verification of prevention bands algorithms. The method, which has been implemented in the Prototype Verification System (PVS), is illustrated with a provably correct 3-dimensional (3D) prevention bands algorithm for track angle maneuvers.
  • Keywords
    Formal verification , Theorem proving , Air traffic management
  • Journal title
    Science of Computer Programming
  • Serial Year
    2012
  • Journal title
    Science of Computer Programming
  • Record number

    1080294