In this paper, we provide two compositional algorithms to solve safety games and apply them to provide compositional algorithms for the LTL synthesis problem. We have implemented t...
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
Planning for partially observable, nondeterministic domains is a very signi cant and computationally hard problem. Often, reasonable assumptions can be drawn over expected/nominal...
Abstract-- We present a computational framework for automatic synthesis of a feedback control strategy for a piecewise affine (PWA) system from a specification given as a Linear Te...
Jana Tumova, Boyan Yordanov, Calin Belta, Ivana Ce...