Satisfiability checking for mission-time \textsf{LTL} (MLTL)
From MaRDI portal
Publication:2105410
DOI10.1016/J.IC.2022.104923OpenAlexW4281812495MaRDI QIDQ2105410FDOQ2105410
Authors: Jianwen Li, Moshe Y. Vardi, Kristin Yvonne Rozier 
Publication date: 8 December 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2022.104923
Recommendations
- Satisfiability checking for mission-time LTL
- Maximum satisfiability of mission-time linear temporal logic
- An SMT-based approach to satisfiability checking of MITL
- A tool for deciding the satisfiability of continuous-time metric temporal logic
- Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers
satisfiability checkingconflict-driven satisfiability checkingLTL over finite tracesSAT-based satisfiability checking
Cites Work
- Some Recent Results in Metric Temporal Logic
- The complexity of propositional linear temporal logics
- A really temporal logic
- The benefits of relaxing punctuality
- Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
- Enhanced vacuity detection in linear temporal logic.
- An SMT-based approach to satisfiability checking of MITL
- Tomorrow and All our Yesterdays: MTL Satisfiability over the Integers
- More scalable LTL model checking via discovering design-space dependencies \((D^3)\)
- Synthesizing non-vacuous systems
- Theorem proving for metric temporal logic over the naturals
- The unary fragments of metric interval temporal logic: bounded versus lower bound constraints
Cited In (4)
Uses Software
This page was built for publication: Satisfiability checking for mission-time \textsf{LTL} (MLTL)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105410)
