Accelerating LTL satisfiability checking by SAT solvers

2018 ◽  
Vol 28 (6) ◽  
pp. 1011-1030
Author(s):  
Jianwen Li ◽  
Geguang Pu ◽  
Lijun Zhang ◽  
Moshe Y Vardi ◽  
Jifeng He
2014 ◽  
Vol 12 (4) ◽  
pp. 522-557 ◽  
Author(s):  
Marcello M. Bersani ◽  
Achille Frigeri ◽  
Angelo Morzenti ◽  
Matteo Pradella ◽  
Matteo Rossi ◽  
...  

Author(s):  
Jianwen Li ◽  
Kristin Y. Rozier ◽  
Geguang Pu ◽  
Yueling Zhang ◽  
Moshe Y. Vardi

We present a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transition system for the input LTLf formula; satisfiability checking is then reduced to a path-search problem over this transition system. Furthermore, we introduce CDLSC (Conflict-Driven LTLf Satisfiability Checking), a novel algorithm that leverages information produced by propositional SAT solvers from both satisfiability and unsatisfiability results. Experimental evaluations show that CDLSC outperforms all other existing approaches for LTLf satisfiability checking, by demonstrating an approximate four-fold speed-up compared to the second-best solver.


2017 ◽  
Vol 30 (2) ◽  
pp. 193-217 ◽  
Author(s):  
Jianwen Li ◽  
Lijun Zhang ◽  
Shufang Zhu ◽  
Geguang Pu ◽  
Moshe Y. Vardi ◽  
...  

2021 ◽  
Vol 63 (12) ◽  
pp. 2178-2188
Author(s):  
A. Yu. Маtrosova ◽  
V. А. Provkin ◽  
V. Z. Tychinskiy ◽  
Е. А. Nikolaeva ◽  
G. G. Goshin
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document