LTL_f satisfiability checking

zbMATH Open1366.68177arXiv1403.1666MaRDI QIDQ5283016FDOQ5283016

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

Publication date: 18 July 2017

Full work available at URL: https://arxiv.org/abs/1403.1666

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (6)

• Constraint LTL satisfiability checking without automata
• Synchronous or alternating? LTL black-box checking of Mealy machines by combining the LearnLib and LTSmin
• Finite-trace linear temporal logic: coinductive completeness
• First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
• An Asymptotically Correct Finite Path Semantics for LTL
• Title not available (Why is that?)

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)