We provide a learning-based technique for guessing a winning strategy in a parity game
originating from an LTL synthesis problem. A cheaply obtained guess can be useful in …

We present a novel method to compute permissive winning strategies in two-player games
over finite graphs with ω-regular winning conditions. Given a game graph G and a parity …

Hyperproperties are commonly used to define information-flow policies and other re-
quirements that reason about the relationship between multiple traces in a system. We …

We present algorithms for model checking and controller synthesis of timed automata,
seeing a timed automaton model as a parallel composition of a large finite-state machine …

We study transformations of automata and games using Muller conditions into equivalent
ones using parity or Rabin conditions. We present two transformations, one that turns a …

We present an innovative approach to the reactive synthesis of parity automaton
specifications, which plays a pivotal role in the synthesis of linear temporal logic. We find …

Temporal causality describes what concrete input behavior is responsible for some
observed output behavior on a trace of a reactive system, and can be used to, eg, generate …

This paper discusses the problem of efficiently solving parity games where player Odd has
to obey an additional'strong transition fairness constraint'on its vertices--given that a player …

Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive
system from its temporal logic specification. Despite its attractiveness and major research …

We present a novel method to compute $\textit {assume-guarantee contracts} $ in non-
zerosum two-player games over finite graphs where each player has a different $\omega …