Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Computing Weakest Strategies for Safety Games of Imperfect Information
verfasst von : Wouter Kuijper, Jaco van de Pol
Erschienen in: Tools and Algorithms for the Construction and Analysis of Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
cedar
(Counter Example Driven Antichain Refinement) is a new symbolic algorithm for computing weakest strategies for safety games of imperfect information. The algorithm computes a fixed point over the lattice of
contravariant antichains.
Here contravariant antichains are antichains over
pairs
consisting of an information set and an allow set representing the associated move. We demonstrate how the richer structure of contravariant antichains for representing antitone functions, as opposed to standard antichains for representing sets of downward closed sets, allows
cedar
to apply a significantly less complex controllable predecessor step than previous algorithms.