FMitF: Track II: StarV: A Quantitative Verification Tool for Learning-enabled Cyber-Physical Systems

Information

  • NSF Award
  • 2422183
Owner
  • Award Id
    2422183
  • Award Effective Date
    10/1/2024 - 5 months ago
  • Award Expiration Date
    9/30/2026 - a year from now
  • Award Amount
    $ 149,343.00
  • Award Instrument
    Standard Grant

FMitF: Track II: StarV: A Quantitative Verification Tool for Learning-enabled Cyber-Physical Systems

Data-driven machine learning (ML) components have been deployed in multiple cyber-physical systems, from sensing and perception to planning and control. However, the reliability and safety of such ML-based applications remain the most challenging and significant concern for the industry, users, and regulators. Rigorous effort has been made to develop formal methods for ML-based application certification. Most research focuses on qualitative verification of the safety and robustness of neural networks and neural network control systems. There is a lack of methods that can quantitatively verify the temporal properties of ML-based applications, which has been a problem of keen interest for industrial companies in the automotive industry, as quantitative verification results, e.g., probability of collision, provide richer information for better decision-making and planning of autonomous systems under sensing, perception and actuating uncertainties. This project proposes to continue collaborations with industrial partners to develop a new quantitative verification approach for temporal properties of learning-enabled cyber-physical systems (Le-CPS). The project's novelties are the development of new ProbStar Temporal Logic (PSTL) for specifying complex temporal behaviors of Le-CPS and new qualitative and quantitative verification algorithms for verifying Le-CPS temporal properties. The project's impact is supporting transitioning advanced verification technologies into practice via developing a user-friendly interface and improving documentation, benchmarks, evaluation, and engagement with the broader community. <br/><br/>The first research objective is to develop the first qualitative and quantitative verification approach for Le-CPS at the system level based on ProbStar reachability. The exact verification scheme provides the precise probability of a safety probability being satisfied, while the approximate scheme obtains the estimated lower and upper bounds of this satisfaction probability. Notably, the exact verification scheme can also construct and visualize the complete set of counterexamples. The second research objective is to develop ProbStar Temporal Logic (PSTL), a formalism enabling quantitative verification of temporal properties of Le-CPS. To construct ProbStar traces, the investigator will develop depth-first-search Prob=Star reachability algorithms for Le-CPS. Finally, the investigator team will develop a new quantitative verification algorithm for temporal properties by transforming a PSTL formula into an abstract disjunctive normal form (DNF) and realizing it on ProbStar traces. To facilitate the adoption of new verification techniques into real robotic applications, the project will develop a user-friendly interface and Robotic Operating System (ROS) integration interface, which supports ROS message collecting, generating verification and monitoring ROS nodes, and creating modeling ROS nodes. The project team will evaluate the efficiency of the new verification algorithms and tool on well-known benchmarks such as advanced emergency braking systems, learning-enabled adaptive cruise control systems, and real learning-enabled F1Tenth testbed.<br/><br/>This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

  • Program Officer
    Damian Dechevddechev@nsf.gov7032928910
  • Min Amd Letter Date
    7/10/2024 - 7 months ago
  • Max Amd Letter Date
    7/10/2024 - 7 months ago
  • ARRA Amount

Institutions

  • Name
    University of Nebraska-Lincoln
  • City
    LINCOLN
  • State
    NE
  • Country
    United States
  • Address
    2200 VINE ST # 830861
  • Postal Code
    685032427
  • Phone Number
    4024723171

Investigators

  • First Name
    Dung
  • Last Name
    Tran
  • Email Address
    dtran30@unl.edu
  • Start Date
    7/10/2024 12:00:00 AM

Program Element

  • Text
    FMitF: Formal Methods in the F

Program Reference

  • Text
    FMitF-Formal Methods in the Field
  • Text
    PROGRAMMING LANGUAGES
  • Code
    7943
  • Text
    EXP PROG TO STIM COMP RES
  • Code
    9150