Sciweavers

31 search results - page 4 / 7
» Minimum-Time Reachability in Timed Games
Sort
View
FORMATS
2007
Springer
14 years 2 months ago
Efficient On-the-Fly Algorithms for Partially Observable Timed Games
In this paper, we review some recent results on the efficient synthesis of controllers for timed systems. We first recall the basics of controller synthesis for timed games and the...
Franck Cassez
CAV
2007
Springer
98views Hardware» more  CAV 2007»
14 years 5 months ago
UPPAAL-Tiga: Time for Playing Games!
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototy...
Gerd Behrmann, Agnès Cougnard, Alexandre Da...
ATVA
2010
Springer
148views Hardware» more  ATVA 2010»
13 years 12 months ago
Recursive Timed Automata
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Ashutosh Trivedi, Dominik Wojtczak
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
14 years 2 months ago
Air traffic management with target windows: An approach using reachability
Abstract-- We present the applications of reachability methods and computational tools based on game theory to a problem in air traffic management. The use of such methods in air t...
Kostas Margellos, John Lygeros
IJFCS
2008
158views more  IJFCS 2008»
13 years 11 months ago
An Alternative Construction in Symbolic Reachability Analysis of Second Order Pushdown Systems
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
Anil Seth