Accelerating LTL satisfiability checking by SAT solvers
From MaRDI portal
Publication:4612433
Recommendations
- SAT-based explicit LTL reasoning and its application to satisfiability checking
- An explicit transition system construction approach to LTL satisfiability checking
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
- \(\mathrm{LTL}_{f}\) satisfiability checking
- Constraint LTL satisfiability checking without automata
Cited in
(14)- scientific article; zbMATH DE number 5158957 (Why is no real title available?)
- SAT-based explicit LTL reasoning and its application to satisfiability checking
- scientific article; zbMATH DE number 2086516 (Why is no real title available?)
- An explicit transition system construction approach to LTL satisfiability checking
- Satisfiability checking for mission-time LTL
- \(\mathrm{LTL}_{f}\) satisfiability checking
- Antichains: Alternative Algorithms for LTL Satisfiability and Model-Checking
- Simplification in a satisfiability checker for VLSI applications
- Constraint LTL satisfiability checking without automata
- Variable and clause elimination for LTL satisfiability checking
- Early verification of legal compliance via bounded satisfiability checking
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
- Correct Hardware Design and Verification Methods
- scientific article; zbMATH DE number 7365811 (Why is no real title available?)
This page was built for publication: Accelerating LTL satisfiability checking by SAT solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612433)