359 search results - page 12 / 72 » Reachability for Continuous and Hybrid Systems |
NSDI
2008
13 years 10 months ago
2008
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
FORMATS
2005
Springer
14 years 1 months ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
RTSS
1998
IEEE
14 years 15 hour ago
1998
IEEE
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
HYBRID
2001
Springer
14 years 7 days ago
2001
Springer
Abstract. The algorithmic design of least restrictive controllers for hybrid systems that satisfy reachability specifications has received much attention recently. Despite the imp...