169 citations · 371 across the 16 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2016★ 1 cited
Partial Solvers for Parity Games: Effective Polynomial-Time Composition
Patrick Ah-Fat, Michael Huth
Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners…
cs.LO2014★ 4 cited
Fatal Attractors in Parity Games: Building Blocks for Partial Solvers
Michael Huth, Jim Huan-Pu Kuo, Nir Piterman
Attractors in parity games are a technical device for solving "alternating" reachability of given node sets. A well known solver of parity games - Zielonka's algorithm - uses such…
cs.LO2004★ 11 cited
Labelled transition systems as a Stone space
Michael Huth
A fully abstract and universal domain model for modal transition systems and refinement is shown to be a maximal-points space model for the bisimulation quotient of labelled transi…