29 citations · 149 across the 31 of their papers we have counts for
Showing 2014Show all
3 papers · 1 filter
cs.LO2014★ 5 cited
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…
cs.LO2014★ 2 cited
Probably Safe or Live
Joost-Pieter Katoen, Lei Song, Lijun Zhang
This paper presents a formal characterisation of safety and liveness properties à la Alpern and Schneider for fully probabilistic systems. As for the classical setting, it is estab…
cs.LO2014★ 5 cited
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…