104 search results - page 9 / 21 » On Reachability for Hybrid Automata over Bounded Time |
110
click to vote
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
FOSSACS
2009
Springer
15 years 3 months ago
2009
Springer
We study generalized fixed-point equations over idempotent semirings and provide an efficient algorithm for the detection whether a sequence of Kleene's iterations stabilizes ...
104
click to vote
HYBRID
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
113
click to vote
FORMATS
2004
Springer
15 years 5 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
HYBRID
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...