104 search results - page 1 / 21 » On Reachability for Hybrid Automata over Bounded Time |
CORR
2011
Springer
12 years 11 months ago
2011
Springer
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
HYBRID
2009
Springer
13 years 11 months ago
2009
Springer
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
ENTCS
2006
13 years 4 months ago
2006
The application of formal methods to analog and mixed signal circuits requires efficient methods tructing abstractions of circuit behaviors. This paper concerns the verification o...
CAV
2006
Springer
13 years 8 months ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
HYBRID
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...