27 citations · 187 across the 36 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2017
An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space
John Fearnley, Sanjay Jain, Sven Schewe +2
Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that…
cs.LO2012★ 5 cited
Bounded Satisfiability for PCTL
Nathalie Bertrand, John Fearnley, Sven Schewe
While model checking PCTL for Markov chains is decidable in polynomial-time, the decidability of PCTL satisfiability, as well as its finite model property, are long standing open p…