18 citations · 45 across the 8 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013★ 7 cited
Satisfiability Games for Branching-Time Logics
Oliver Friedmann, Martin Lange, Markus Latte
The satisfiability problem for branching-time temporal logics like CTL*, CTL and CTL+ has important applications in program specification and verification. Their computational comp…
cs.CC2013
An exponential lower bound for Cunningham's rule
David Avis, Oliver Friedmann
In this paper we give an exponential lower bound for Cunningham's least recently considered (round-robin) rule as applied to parity games, Markhov decision processes and linear pro…