9 citations · 51 across the 16 of their papers we have counts for
9 papers · 1 filter
SAT-based Explicit LTLf Satisfiability Checking
Jianwen Li, Kristin Y. Rozier, Geguang Pu +2
We present here a SAT-based framework for LTLf (Linear Temporal Logic on Finite Traces) satisfiability checking. We use propositional SAT-solving techniques to construct a transiti…
A Symbolic Approach to Safety LTL Synthesis
Shufang Zhu, Lucas M. Tabajara, Jianwen Li +2
Temporal synthesis is the automated design of a system that interacts with an environment, using the declarative specification of the system's behavior. A popular language for prov…
Symbolic LTLf Synthesis
Shufang Zhu, Lucas M. Tabajara, Jianwen Li +2
LTLf synthesis is the process of finding a strategy that satisfies a linear temporal specification over finite traces. An existing solution to this problem relies on a reduction to…
Safety Model Checking with Complementary Approximations
Jianwen Li, Shufang Zhu, Yueling Zhang +2
Formal verification techniques such as model checking, are becoming popular in hardware design. SAT-based model checking techniques such as IC3/PDR, have gained a significant succe…
SAT-based Explicit LTL Reasoning
Jianwen Li, Shufang Zhu, Geguang Pu +1
We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving. As a proof-of-concept of th…
LTLf satisfiability checking
Jianwen Li, Lijun Zhang, Geguang Pu +2
We consider here Linear Temporal Logic (LTL) formulas interpreted over \emph{finite} traces. We denote this logic by LTLf. The existing approach for LTLf satisfiability checking is…
Fast LTL Satisfiability Checking by SAT Solvers
Jianwen Li, Geguang Pu, Lijun Zhang +2
Satisfiability checking for Linear Temporal Logic (LTL) is a fundamental step in checking for possible errors in LTL assertions. Extant LTL satisfiability checkers use a variety of…
Polsat: A Portfolio LTL Satisfiability Solver
Jianwen Li, Geguang Pu, Lijun Zhang +3
In this paper we present a portfolio LTL-satisfiability solver, called Polsat. To achieve fast satisfiability checking for LTL formulas, the tool integrates four representative LTL…
MDM: A Mode Diagram Modeling Framework
Zheng Wang, Geguang Pu, Jianwen Li +5
Periodic control systems used in spacecrafts and automotives are usually period-driven and can be decomposed into different modes with each mode representing a system state observe…