Accelerating LTL satisfiability checking by SAT solvers

DOI10.1093/LOGCOM/EXY013zbMath1410.68235OpenAlexW2796612952WikidataQ130117311 ScholiaQ130117311MaRDI QIDQ4612433

Moshe Y. Vardi, Geguang Pu, Jifeng He, Jianwen Li, Li-jun Zhang

Publication date: 31 January 2019

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exy013

zbMATH Keywords

linear temporal logicsatisfiability checkingLTL satisfiability checkingobligation formulaSAT-based LTL satisfiability checking

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Temporal logic (03B44)

Related Items (1)

SAT-based explicit LTL reasoning and its application to satisfiability checking

This page was built for publication: Accelerating LTL satisfiability checking by SAT solvers