203 search results - page 5 / 41 » Improved undecidability results on weighted timed automata |
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
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...
REX
1991
13 years 11 months ago
1991
Abstract. We consider an optimal-reachability problem for a timed automaton with respect to a linear cost function which results in a weighted timed automaton. Our solution to this...
TCS
2002
13 years 7 months ago
2002
An instance of the (Generalized) Post Correspondence Problem is during the decision process typically reduced to one or more other instances, called its successors. In this paper ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
STACS
2007
Springer
14 years 1 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...