12 search results - page 1 / 3 » Symbolic Reachability Analysis of Lazy Linear Hybrid Automat... |
FORMATS
2007
Springer
13 years 10 months ago
2007
Springer
HYBRID
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. This paper describes the implementation of predicate abstraction techniques to automatically compute symbolic backward reachable sets of high dimensional piecewise affine...
IJFCS
2008
13 years 4 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...
HYBRID
1999
Springer
13 years 8 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...