Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations (1999) [26 citations — 4 self]
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@INPROCEEDINGS{Chutinan99verificationof,author = {Alongkrit Chutinan and Bruce H. Krogh},
title = {Verification of polyhedral-invariant hybrid automata using polygonal flow pipe approximations},
booktitle = {In: HSCC. LNCS 1569},
year = {1999},
pages = {76--90},
publisher = {Springer}
}
Years of Citing Articles
Abstract:
Abstract. This paper presents a computational technique for verifying properties of hybrid systems with arbitrary continuous dynamics. The approach is based on the computation of approximating automata, which are finite-state approximations to the (possibly infinite-state) discretetrace transition system for the hybrid system. The fundamental computation in the generation of approximating automata is the mapping of sets of continuous states to the boundaries of the location invariants. This mapping is computed by intersecting flow pipes, the sets of reachable states for continuous systems, with the invariant boundaries. Flow pipes are approximated by sequences of overlapping convex polygons. The paper presents an application of the computational procedure to a benchmark hybrid system, a batch evaporator. 1
Citations
| 222 | Automatic symbolic verification of embedded systems – Alur, Ho - 1996 |
| 111 | Verification tools for finite-state concurrent systems – Clarke, Grumberg, et al. - 1994 |
| 11 | Computing polyhedral approximations to dynamic flow pipes – Chutinan, Krogh - 1998 |
| 10 | Computing Approximating Automata for a Class of Linear Hybrid Systems – Chutinan, Krogh - 1999 |
| 6 | Computing approximating automata for a class of hybrid systems. submitted to Mathematical Modeling of Systems: Special Issue on Discrete Event Models of Continuous Systems – Chutinan, Krogh - 1997 |
