LTL_f satisfiability checking
From MaRDI portal
Publication:5283016
Recommendations
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
- An explicit transition system construction approach to LTL satisfiability checking
- Accelerating LTL satisfiability checking by SAT solvers
- LTL on finite and process traces: complexity results and a practical reasoner
- Constraint LTL satisfiability checking without automata
Cited in
(17)- scientific article; zbMATH DE number 7445165 (Why is no real title available?)
- Constraint LTL satisfiability checking without automata
- An explicit transition system construction approach to LTL satisfiability checking
- Fairness modulo theory: a new approach to LTL software model checking
- Synchronous or alternating? LTL black-box checking of Mealy machines by combining the LearnLib and LTSmin
- Satisfiability of linear time mu-calculus on finite traces
- Accelerating LTL satisfiability checking by SAT solvers
- Variable and clause elimination for LTL satisfiability checking
- Finite-trace linear temporal logic: coinductive completeness
- LTL on finite and process traces: complexity results and a practical reasoner
- Constructive finite trace analysis with linear temporal logic
- First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
- An Asymptotically Correct Finite Path Semantics for LTL
- SMT-based satisfiability of first-order LTL with event freezing functions and metric operators
- The complexity of traversing automata with current state uncertainty under \(\mathrm{LTL}_{f}\) constraints
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
- SAT-based explicit LTL reasoning and its application to satisfiability checking
This page was built for publication: \(\mathrm{LTL}_{f}\) satisfiability checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283016)
