920 citations
- Institute of SoftwareCN78 papers
- Chinese Academy of SciencesCN77 papers
- University of WaterlooCA22 papers
- University of Chinese Academy of SciencesCN20 papers
- University of GuelphCA19 papers
- Tsinghua UniversityCN18 papers
- University of Technology SydneyAU17 papers
- Joint Center for Quantum Information and Computer ScienceUS8 papers
- Perimeter InstituteCA8 papers
- University of Maryland, College ParkUS7 papers
- Institute of PhysicsPL5 papers
- State Key Laboratory of Low-Dimensional Quantum Physics5 papers
Showing 2014 · cs.LOShow all
2 papers · 2 filters
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…