627 search results - page 1 / 126 » Efficient On-the-Fly Algorithms for the Analysis of Timed Ga... |
QEST
2006
IEEE
13 years 11 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
CONCUR
2005
Springer
13 years 11 months ago
2005
Springer
FORMATS
2007
Springer
13 years 9 months ago
2007
Springer
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...
FORMATS
2009
Springer
13 years 9 months ago
2009
Springer
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
ICALP
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...