#### DMCA

## PHAVer: Algorithmic verification of hybrid systems past HyTech (2005)

### Cached

### Download Links

- [www-verimag.imag.fr]
- [www-verimag.imag.fr]
- [www-verimag.imag.fr]
- [www-verimag.imag.fr]
- [www-verimag.imag.fr]
- [www-verimag.imag.fr]
- DBLP

### Other Repositories/Bibliography

Citations: | 207 - 8 self |

### Citations

670 | The theory of hybrid automata
- Henzinger
- 1996
(Show Context)
Citation Context ...tain either an exact result or a conservative overapproximation of the behavior of the system, e.g., as the set of reachable states. An exact computation is possible with linear hybrid automata (LHA) =-=[1]-=-, which are defined by linear predicates and piecewise constant bounds on the derivatives. They were proposed and studied in detail by Henzinger et al., see [2] for an extensive discussion, who presen... |

461 | H.: HyTech: A model checker for hybrid systems
- Henzinger, Ho, et al.
- 1997
(Show Context)
Citation Context ...They were proposed and studied in detail by Henzinger et al., see [2] for an extensive discussion, who presented in 1995 a tool called HyTech that could perform various computations with such systems =-=[3]-=-. It featured a powerful input language and functionality, but suffered from a major flaw: its exact arithmetic was using limited digits, which can quickly lead to overflow errors. While it was succes... |

133 | Algorithmic analysis of nonlinear hybrid systems
- Henzinger, Ho, et al.
- 1995
(Show Context)
Citation Context ...ns, but it was also 50–1000 times slower than the later version written in C++ [13]. Our on-the-fly overapproximation essentially performs a partitioning of the state space similar to the approach in =-=[14]-=-. For the simplification of polyhedra it has been suggested to use bounding boxes or oriented rectangular hulls [15]. Instead, we propose to simply drop the 1 Not addressed are more advanced input cap... |

119 | HyTech: The next generation
- Henzinger, Ho, et al.
- 1995
(Show Context)
Citation Context ...so apart from HyTech. The first HyTech prototype was implemented in Mathematica and did not have any numerical restrictions, but it was also 50–1000 times slower than the later version written in C++ =-=[13]-=-. Our on-the-fly overapproximation essentially performs a partitioning of the state space similar to the approach in [14]. For the simplification of polyhedra it has been suggested to use bounding box... |

69 | Possibly not closed convex polyhedra and the Parma Polyhedra Library
- Bagnara, Ricci, et al.
- 2002
(Show Context)
Citation Context ...h PHAVer (Polyhedral Hybrid Automaton Verifyer), a new tool for analyzing linear hybrid automata with the following characteristics:s– exact and robust arithmetic based on the Parma Polyhedra Library =-=[6]-=-, – on-the-fly overapproximation of piecewise affine dynamics, – conservative limiting of bits and constraints in polyhedral computations, – support for compositional and assume-guarantee reasoning. 1... |

65 | Beyond HYTECH: Hybrid systems analysis using interval numerical methods
- Henzinger, Horowitz, et al.
- 2000
(Show Context)
Citation Context ...nd for assume-guarantee reasoning. For lack of space, the reader is referred to [9] for further details on the approach. Earlier attempts to improve over HyTech include the use of interval arithmetic =-=[10]-=-, which can quickly lead to prohibitively large overapproximations. An algorithm specialized on rectangular automata was proposed in [11] and implemented based on the HyTech engine. It is able to use ... |

51 | Benchmarks for hybrid systems verification
- FEHNKER, IVANČIĆ
(Show Context)
Citation Context ...ethods to simplify polyhedra by limiting both the number of bits and contraints. The applicability of PHAVer and the effectiveness of the proposed methods are demonstrated with a navigation benchmark =-=[7]-=-, and a tunnel diode circuit [8]. In addition to the reachability algorithm, PHAVer includes a separate engine for computing simulation relations between hybrid automata. It can be used to verify equi... |

49 |
Towards formal verification of analog designs
- Gupta, Krogh, et al.
- 2004
(Show Context)
Citation Context ...limiting both the number of bits and contraints. The applicability of PHAVer and the effectiveness of the proposed methods are demonstrated with a navigation benchmark [7], and a tunnel diode circuit =-=[8]-=-. In addition to the reachability algorithm, PHAVer includes a separate engine for computing simulation relations between hybrid automata. It can be used to verify equivalence or abstraction between d... |

42 | Efficient representation and computation of reachable sets for hybrid systems
- Stursberg, Krogh
- 2003
(Show Context)
Citation Context ...n essentially performs a partitioning of the state space similar to the approach in [14]. For the simplification of polyhedra it has been suggested to use bounding boxes or oriented rectangular hulls =-=[15]-=-. Instead, we propose to simply drop the 1 Not addressed are more advanced input capabilities like hierarchy, templates and directional communication labels, since we consider these easily and more ap... |

36 |
An assessment of the Current Status of Algorithmic Approaches to the Verification of Hybrid Systems
- Silva, Stursberg, et al.
- 2001
(Show Context)
Citation Context ... handled by a GUI-frontend or editor.sleast significant of the constraints, as this seems a good compromise in terms of accuracy and speed. For a survey of verification tools for hybrid automata, see =-=[16]-=-. In the next section, we will briefly introduce the hybrid automaton model used by PHAVer, which has a simple Input/Output structure to support compositional reasoning. In Sect. 3 we present the reac... |

26 | Some lessons from the HYTECH experience
- Henzinger, Preussig, et al.
(Show Context)
Citation Context ...ionality, but suffered from a major flaw: its exact arithmetic was using limited digits, which can quickly lead to overflow errors. While it was successfully used to analyze a number of examples, see =-=[4,5]-=- and references therein, the overflow problem prohibits any application to more complex systems. The valuable experiences with HyTech have prompted a number of suggestions for improvement, a summary o... |

24 | Automatic Analysis of Hybrid Systems
- Ho
- 1995
(Show Context)
Citation Context ...sible with linear hybrid automata (LHA) [1], which are defined by linear predicates and piecewise constant bounds on the derivatives. They were proposed and studied in detail by Henzinger et al., see =-=[2]-=- for an extensive discussion, who presented in 1995 a tool called HyTech that could perform various computations with such systems [3]. It featured a powerful input language and functionality, but suf... |

14 | Assume-Guarantee Reasoning for Hybrid I/O-automata by Over-approximation of Continuous Interaction
- Frehse, Han, et al.
- 2004
(Show Context)
Citation Context ...ation relations between hybrid automata. It can be used to verify equivalence or abstraction between different models, and for assume-guarantee reasoning. For lack of space, the reader is referred to =-=[9]-=- for further details on the approach. Earlier attempts to improve over HyTech include the use of interval arithmetic [10], which can quickly lead to prohibitively large overapproximations. An algorith... |

9 |
An algorithm for the approximative analysis of rectangular automata
- Preussig, Kowalewski, et al.
- 1998
(Show Context)
Citation Context ... to improve over HyTech include the use of interval arithmetic [10], which can quickly lead to prohibitively large overapproximations. An algorithm specialized on rectangular automata was proposed in =-=[11]-=- and implemented based on the HyTech engine. It is able to use a limited number of bits through component-wise conservative rounding of the coefficients. However, the rectangular over-approximation ca... |

6 | Modeling and Analysis of Hybrid Systems
- Ivancic
- 2003
(Show Context)
Citation Context ...d, then switched to normal reachability, and at iteration 40 a bounding box simplification was triggered manually. In comparison, for a predicate abstraction tool the following times were reported in =-=[18]-=-: For NAV01–NAV03 34s, 153s (68MB) and 152s (180MB), respectively, on a Sun Enterprise 3000 (4 x 250 MHz UltraSPARC) with 1 GB RAM. Table 1. Computation times and memory requirements Automaton Reachab... |

4 | Applications of model checking at Honeywell Laboratories
- Cofer, Engstrom, et al.
(Show Context)
Citation Context ...ionality, but suffered from a major flaw: its exact arithmetic was using limited digits, which can quickly lead to overflow errors. While it was successfully used to analyze a number of examples, see =-=[4,5]-=- and references therein, the overflow problem prohibits any application to more complex systems. The valuable experiences with HyTech have prompted a number of suggestions for improvement, a summary o... |

4 |
Formale Überprüfung der Korrektheit von Steuerungen mittels rektangulärer Automaten
- Preußig
- 2000
(Show Context)
Citation Context ...e a limited number of bits through component-wise conservative rounding of the coefficients. However, the rectangular over-approximation can become prohibitively large. An improvement was proposed in =-=[12]-=- by allowing arbitrary convex polyhedra. It also incorporates a strategy to reduce the number of bits by component-wise overapproximation, but is based on a vertice representation of polyhedra and its... |