Sciweavers

TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
13 years 11 months ago
Computing Weakest Strategies for Safety Games of Imperfect Information
CEDAR (Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes ...
Wouter Kuijper, Jaco van de Pol