Sciweavers

39 search results - page 5 / 8
» Reachability-Time Games on Timed Automata
Sort
View
FORMATS
2006
Springer
14 years 6 days ago
Model Checking Timed Automata with Priorities Using DBM Subtraction
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
Alexandre David, John Håkansson, Kim Guldstr...
ICALP
2007
Springer
14 years 2 months ago
Minimum-Time Reachability in Timed Games
Abstract. We consider the minimum-time reachability problem in concurrent two-player timed automaton game structures. We show how to compute the minimum time needed by a player to ...
Thomas Brihaye, Thomas A. Henzinger, Vinayak S. Pr...
CAV
2007
Springer
98views Hardware» more  CAV 2007»
14 years 2 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...
DATE
2008
IEEE
101views Hardware» more  DATE 2008»
14 years 3 months ago
A Game-Theoretic Approach to Real-Time System Testing
This paper presents a game-theoretic approach to the testing of uncontrollable real-time systems. By modelling the systems with Timed I/O Game Automata and specifying the test pur...
Alexandre David, Kim Guldstrand Larsen, Shuhao Li,...
LFCS
2007
Springer
14 years 2 months ago
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier