6 search results - page 1 / 2 » Reachability for Linear Hybrid Automata Using Iterative Rela... |
HYBRID
2007
Springer
13 years 11 months ago
2007
Springer
HYBRID
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
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...
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...