Theoretical Computer Science
Languages, automata, and logic
Handbook of formal languages, vol. 3
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Liveness in timed and untimed systems
Information and Computation
Discrete-time control for rectangular hybrid automata
Theoretical Computer Science
Timed Control Synthesis for External Specifications
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Modularity for Timed and Hybrid Systems
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
As Soon as Possible: Time Optimal Control for Timed Automata
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
How much memory is needed to win infinite games?
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
On conciseness of extensions of timed automata
Journal of Automata, Languages and Combinatorics
Trading Infinite Memory for Uniform Randomness in Timed Games
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Timed Parity Games: Complexity and Robustness
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Efficient on-the-fly emptiness check for timed Büchi automata
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Synthesis of memory-efficient "real-time" controllers for safety objectives
Proceedings of the 14th international conference on Hybrid systems: computation and control
Timed alternating-time temporal logic
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Efficient emptiness check for timed büchi automata
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Reachability-time games on timed automata
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
We study synthesis of controllers for real-time systems, where the objective is to stay in a given safe set. The problem is solved by obtaining winning strategies in the setting of concurrent two player timed automaton games with safety objectives. To prevent a player from winning by blocking time, we restrict each player to strategies that ensure that the player cannot be responsible for causing a Zeno run. We construct winning strategies for the controller which require access only to (1) the system clocks (thus, controllers which require their own internal infinitely precise clocks are not necessary), and (2) a logarithmic (in the number of clocks) number of memory bits (i.e. a linear number of memory states). Precisely, we show that for safety objectives, a memory of size (3+lg(|C|+1)) bits suffices for winning controller strategies, where C is the set of clocks of the timed automaton game, significantly improving the previous known exponential memory states bound. We also settle the open question of whether winning region-based strategies require memory for safety objectives by showing with an example the necessity of memory for such strategies to win for safety objectives. Finally, we show that the decision problem of determining if there exists a receptive player-1 winning strategy for safety objectives is EXPTIME-complete over timed automaton games.