Invited Talk.- Ackermannian Completion of Separators.- Infinite Games.- Fair Omega-regular Games.- Stochastic Window Mean-Payoff Games.- Symbolic Solution of Emerson-Lei Games for Reactive Synthesis.- Parity Games on Temporal Graphs.- Categorical Semantics.

- Drawing from an Urn is Isometric.- Enriching Diagrams with Algebraic Operations.- Monoidal Extended Stone Duality.- Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory).- Automata and Synthesis.- Determinization of Integral Discounted-Sum Automata is Decidable.- Checking History-Determinism is NP-hard for Parity Automata.- Tighter Construction of Tight Büchi Automata.

- Synthesis with Privacy Against an Observer.