Personal tools
You are here: Home Graduate Study Combinations and Abstractions of Formal Games

Combinations and Abstractions of Formal Games

Develop a principled, clean account of how games and their abstractions may be combined.

Formal two-player games have a long history in computer science and outside. They have been applied in the verification of systems, where the players aim respectively to demonstrate a flaw in a system and to demonstrate that the system works as specified. In order to make calculations with such games feasible, it is essential to be able to use abstractions of the games: for example, one considers a large (perhaps infinite) class of game positions all together, until such time as distinctions between the positions force one to treat parts of the class differently. There is a considerable body of such work, which underpins some impressive tools. However, the field still lacks a principled, clean account of how games and their abstractions may be combined. This project should develop such an account.

Prospective Supervisors

Perdita Stevens

Document Actions