1. Realizable and unrealizable specifications of reactive systems;Abadi,1989
2. Memoryless determinacy of parity and mean payoff games: a simple proof;Björklund;Theoretical Computer Science,2004
3. Better quality in synthesis through quantitative objectives;Bloem,2009
4. Infinite runs in weighted timed automata with energy constraints;Bouyer,2008
5. Measuring permissiveness in parity games: Mean-payoff parity games revisited;Bouyer,2011