From compatibility game to realisability game: synthesis made simple on timed interface automata

Xu Wang

(Swansea University, formerly University of Oxford)

This is the second part of our talk on the synthesis of timed
interface automata. We start with the interface synthesis based on
compatibility game. Then we motivate the game of realisability, which
arise out of an anomaly in time, and demonstrate that its duality with
compatibility can give rise a surprisingly simple theory on advanced
timed synthesis, i.e. quotient and conjunction synthesis.
Friday 16th October 2015, 15:30
Robert Recorde Room
Department of Computer Science