Rectangular Hybrid Games
نویسندگان
چکیده
In order to study control problems for hybrid systems, we generalize hybrid automata to hybrid games |say, controller vs. plant. If we specify the continuous dynamics by constant lower and upper bounds, we obtain rectangular games. We show that for rectangular games with objectives expressed in Ltl (linear temporal logic), the winning states for each player can be computed, and winning strategies can be synthesized. Our result is sharp, as already reachability is undecidable for generalizations of rectangular systems, and optimal |singly exponential in the size of the game structure and doubly exponential in the size of the Ltl objective. Our proof systematically generalizes the theory of hybrid systems from automata (single-player structures) [9] to games (multi-player structures): we show that the successively more general in nite-state classes of timed, 2d rectangular, and rectangular games induce successively weaker, but still nite, quotient structures called game bisimilarity, game similarity, and game trace equivalence. These quotients can be used, in particular, to solve the Ltl control problem.
منابع مشابه
Êêêøøòòùððö Àýýööö Ññ×´´üøøòòòò
In order to study control problems for hybrid systems, we generalize hybrid automata to hybrid games |say, controller vs. plant. If we specify the continuous dynamics by constant lower and upper bounds, we obtain rectangular games. We show that for rectangular games with objectives expressed in Ltl (linear temporal logic), the winning states for each player can be computed, and winning strategi...
متن کاملÒøöö Öö Ò Îîööö Blockin Blockinøøóò a Lattice Theory for Solving Games of Imperfect Information
In this paper, we propose a fixed point theory to solve games of imperfect information. The fixed point theory is defined on the lattice of antichains of sets of states. Contrary to the classical solution proposed by Reif [Rei84], our new solution does not involve determinization. As a consequence, it is readily applicable to classes of systems that do not admit determinization. Notable example...
متن کاملA Lattice Theory for Solving Games of Imperfect Information
In this paper, we propose a fixed point theory to solve games of imperfect information. The fixed point theory is defined on the lattice of antichains of sets of states. Contrary to the classical solution proposed by Reif [Rei84], our new solution does not involve determinization. As a consequence, it is readily applicable to classes of systems that do not admit determinization. Notable example...
متن کاملSymbolic Algorithms for In nite-State Games?
A procedure for the analysis of state spaces is called sym bolic if it manipulates not individual states but sets of states that are represented by constraints Such a procedure can be used for the analysis of in nite state spaces provided termination is guaranteed We present symbolic procedures and corresponding termination criteria for the so lution of in nite state games which occur in the co...
متن کاملSymbolic Algorithms for Infinite-State Games
A procedure for the analysis of state spaces is called symbolic if it manipulates not individual states, but sets of states that are represented by constraints. Such a procedure can be used for the analysis of infinite state spaces, provided termination is guaranteed. We present symbolic procedures, and corresponding termination criteria, for the solution of infinite-state games, which occur in...
متن کامل