39 search results - page 3 / 8 » Reachability-Time Games on Timed Automata |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
CONCUR
2010
Springer
13 years 9 months ago
2010
Springer
CONCUR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. We propose a new model for timed games, based on concurrent game structures (CGSs). Compared to the classical timed game automata of Asarin et al. [8], our timed CGSs are...
LICS
2010
IEEE
13 years 7 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
FORMATS
2008
Springer
13 years 10 months ago
2008
Springer
We study the problems of existence and construction of infinite schedules for finite weighted automata and one-clock weighted timed automata, subject to boundary constraints on the...