Sciweavers

ICALP
2007
Springer
14 years 6 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin JurdziĀ“nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
ICALP
2009
Springer
15 years 22 days ago
When Are Timed Automata Determinizable?
In this paper, we propose an abstract procedure which, given a timed automaton, produces a language-equivalent deterministic infinite timed tree. We prove that under a certain boun...
Christel Baier, Nathalie Bertrand, Patricia Bouyer...