27 citations · 187 across the 36 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2017★ 2 cited
Reachability Switching Games
John Fearnley, Martin Gairing, Matthias Mnich +1
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic analogue of stochastic…
cs.FL2013★ 27 cited
Reachability in Two-Clock Timed Automata is PSPACE-complete
John Fearnley, Marcin Jurdziński
A recent result of Haase et al. has shown that reachability in two-clock timed automata is log-space equivalent to reachability in bounded one-counter automata. We show that reacha…
cs.FL2012★ 7 cited
Synthesis of Succinct Systems
John Fearnley, Doron Peled, Sven Schewe
Synthesis of correct by design systems from specification has recently attracted much attention. The theoretical results imply that this problem is highly intractable, e.g., synthe…