Satisfiability checking for mission-time LTL

DOI10.1007/978-3-030-25543-5_1MaRDI QIDQ6154870zbMATH OpenOpenAlexFDO

Authors Jianwen Li, Moshe Y. Vardi, Kristin Yvonne Rozier

Publication date 16 February 2024

Published in Computer Aided Verification (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-25543-5_1

Mathematics Subject Classification ID

Temporal logic (03B44) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Satisfiability checking for mission-time \textsf{LTL} (MLTL)
• Maximum satisfiability of mission-time linear temporal logic
• An SMT-based approach to satisfiability checking of MITL
• Accelerating LTL satisfiability checking by SAT solvers
• SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking

Cited in

(8)

• Embedding online runtime verification for fault disambiguation on Robonaut2
• Satisfiability checking for mission-time \textsf{LTL} (MLTL)
• scientific article; zbMATH DE number 7455747 (Why is no real title available?)
• Early verification of legal compliance via bounded satisfiability checking
• Maximum satisfiability of mission-time linear temporal logic
• Model predictive runtime verification for cyber-physical systems with real-time deadlines
• Formalizing MLTL formula progression in Isabelle/HOL
• Bounded satisfiability checking of \(\mathrm{FOL}^*\) formulas with aggregations

This page was built for publication: Satisfiability checking for mission-time LTL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154870)