104 search results - page 8 / 21 » On Reachability for Hybrid Automata over Bounded Time |
HYBRID
2000
Springer
13 years 11 months ago
2000
Springer
We propose a computer-aided methodology to automatically generate time optimal production schemes for chemical batch plants operating in multi-batch mode. Our approach is based on ...
HYBRID
2003
Springer
14 years 21 days ago
2003
Springer
Abstract. The use of algorithmic verification and synthesis tools for hybrid systems is currently limited to systems exhibiting simple continuous dynamics such as timed automata o...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
We propose a remedy to that part of the state-explosion problem for timed automata which is due to interleaving of actions. We prove the following quite surprising result: the unio...
FORMATS
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we study timed games played on weighted timed automata. In this context, the reachability problem asks if, given a set T of locations and a cost C, Player 1 has a st...
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...