Computing Weakest Strategies for Safety Games of Imperfect Information


Share/Save/Bookmark

Kuijper, Wouter and Pol van de, Jaco (2009) Computing Weakest Strategies for Safety Games of Imperfect Information. In: 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2009, 22-29 March 2009, York, UK.

[img]PDF
Restricted to UT campus only
: Request a copy
394Kb
[img]
Preview
PDF
176Kb
Abstract: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.
Item Type:Conference or Workshop Item
Copyright:© 2009 Springer
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/67845
Official URL:http://dx.doi.org/10.1007/978-3-642-00768-2_10
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 263972