Probabilistic Formal Verification of the SATS Concept of Operation

被引:4
|
作者
Sardar, Muhammad Usama [1 ]
Afaq, Nida [1 ]
Hoque, Khaza Anuarul [2 ]
Johnson, Taylor T. [2 ]
Hasan, Osman [1 ]
机构
[1] Natl Univ Sci & Technol, Sch Elect Engn & Comp Sci, Islamabad, Pakistan
[2] Univ Texas Arlington, Dept Comp Sci & Engn CSE, Arlington, TX USA
来源
NASA FORMAL METHODS, NFM 2016 | 2016年 / 9690卷
关键词
Formal verification; Probabilistic analysis; Model checking; SATS; SATS Concept of Operations; Aircraft safety; Aircraft separation; Landing and departure operations;
D O I
10.1007/978-3-319-40648-0_15
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The objective of NASA's Small Aircraft Transportation System (SATS) Concept of Operations (ConOps) is to facilitate High Volume Operation (HVO) of advanced small aircraft operating in non-towered non-radar airports. Given the safety-critical nature of SATS, its analysis accuracy is extremely important. However, the commonly used analysis techniques, like simulation and traditional model checking, do not ascertain a complete verification of SATS due to the wide range of possibilities involved in SATS or the inability to capture the randomized and unpredictable aspects of the SATS ConOps environment in their models. To overcome these limitations, we propose to formulate the SATS ConOps as a fully synchronous and probabilistic model, i.e., SATS-SMA, that supports simultaneously moving aircraft. The distinguishing features of our work include the preservation of safety of aircraft while improving throughput at the airport. Important insights related to take-off and landing operations during the Instrument Meteorological Conditions (IMC) are also presented.
引用
收藏
页码:191 / 205
页数:15
相关论文
共 50 条
  • [1] Towards Probabilistic Formal Analysis of SATS-Simultaneously Moving Aircraft (SATS-SMA)
    Sardar, Muhammad Usama
    Afaq, Nida
    Hasan, Osman
    Hoque, Khaza Anuarul
    JOURNAL OF AUTOMATED REASONING, 2018, 60 (01) : 85 - 105
  • [2] Towards Probabilistic Formal Analysis of SATS-Simultaneously Moving Aircraft (SATS-SMA)
    Muhammad Usama Sardar
    Nida Afaq
    Osman Hasan
    Khaza Anuarul Hoque
    Journal of Automated Reasoning, 2018, 60 : 85 - 105
  • [3] Formal Verification of Probabilistic Swarm Behaviours
    Konur, Savas
    Dixon, Clare
    Fisher, Michael
    SWARM INTELLIGENCE, 2010, 6234 : 440 - 447
  • [4] Formal Probabilistic Timing Verification in RTL
    Kumar, Jayanand Asok
    Vasudevan, Shobha
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2013, 32 (05) : 788 - 801
  • [5] Towards Formal Evaluation and Verification of Probabilistic Design
    Lee, Nian-Ze
    Jiang, Jie-Hong R.
    IEEE TRANSACTIONS ON COMPUTERS, 2018, 67 (08) : 1202 - 1216
  • [6] Proving Obliviousness of Probabilistic Algorithms with Formal Verification
    Yan, Pengbo
    COMPANION PROCEEDINGS OF THE 2022 ACM SIGPLAN INTERNATIONAL CONFERENCE ON SYSTEMS, PROGRAMMING, LANGUAGES, AND APPLICATIONS: SOFTWARE FOR HUMANITY, SPLASH COMPANION 2022, 2022, : 25 - 28
  • [7] Towards Formal Evaluation and Verification of Probabilistic Design
    Lee, Nian-Ze
    Jiang, Jie-Hong R.
    2014 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2014, : 340 - 347
  • [8] Formal Modelling and Verification of Probabilistic Resource Bounded Agents
    Nguyen, Hoang Nga
    Rakib, Abdur
    JOURNAL OF LOGIC LANGUAGE AND INFORMATION, 2023, 32 (05) : 829 - 859
  • [9] Formal Modelling and Verification of Probabilistic Resource Bounded Agents
    Hoang Nga Nguyen
    Abdur Rakib
    Journal of Logic, Language and Information, 2023, 32 : 829 - 859
  • [10] Formal Verification of Higher-Order Probabilistic Programs
    Sato, Tetsuya
    Aguirre, Alejandro
    Barthe, Gilles
    Gaboardi, Marco
    Garg, Deepak
    Hsu, Justin
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2019, 3 (POPL):