Towards symbolic strategy synthesis for <>-LTL

We provide a symbolic algorithm for synthesizing winning strategies in Alternating Time Temporal Logic. ATL has game semantics, which makes it suitable for modeling open systems where coalitions of agents work together to achieve their goals. A typical use of the algorithm would begin with a highly non-deterministic set of agents, A, for which we wish to synthesize behavior. These may be composed with a set of opponent agents, which provide an environment. The desired behavior is then written in <
>-LTL, and a strategy for A to implement this is synthesized. If A implements this strategy, then the system will be guaranteed to satisfy the desired property. The algorithm presented here is part of a work in progress and updates can be found at http://www.cs.bham.ac.uk/ /spl sim/ ath/atl/spl I.bar/synthesis.