This article addresses the problem of temporal-logic-based planning for bipedal robots in
uncertain environments. We first propose an Interval Markov Decision Process abstraction of …

We consider the problem of automatically synthesizing a hybrid controller for non-linear
dynamical systems which ensures that the closed-loop fulfills an arbitrary Linear Temporal …

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 …

This paper considers the problem of solving infinite two-player games over finite graphs
under various classes of progress assumptions motivated by applications in cyber-physical …

Game-theoretic techniques and equilibria analysis facilitate the design and verification of
competitive systems. While algorithmic complexity of equilibria computation has been …

Abstract Generalized Reactivity (1)(GR (1)) synthesis is a reactive synthesis approach in
which the specification is split into two parts: a symbolic game graph, describing the safe …

We examine two-player games over finite weighted graphs with quantitative (mean-payoff or
energy) objective, where one of the players additionally needs to satisfy a fairness objective …

This report presents the results of a friendly competition for formal verification and policy
synthesis of stochastic models. It also introduces new benchmarks and their properties …

We consider two-player games over finite graphs in which both players are restricted by
fairness constraints on their moves. Given a two player game graph G=(V, E) and a set of fair …

We consider the problem of computing the maximal probability of satisfying an ω-regular
specification for stochastic, continuous-state, nonlinear systems evolving in discrete time …