Refining abstractions of hybrid systems using counterexample fragments

A Fehnker, E Clarke, SK Jha, B Krogh - … , March 9-11, 2005. Proceedings 8, 2005 - Springer
Hybrid Systems: Computation and Control: 8th International Workshop, HSCC 2005 …, 2005Springer
Counterexample guided abstraction refinement, a powerful technique for verifying properties
of discrete-state systems, has been extended recently to hybrid systems verification. Unlike
in discrete systems, however, establishing the successor relation for hybrid systems can be
a fairly expensive step since it requires evaluation and over-approximation of the continuous
dynamics. It has been observed that it is often sufficient to consider fragments of
counterexamples rather than complete counterexamples. In this paper we further develop …
Abstract
Counterexample guided abstraction refinement, a powerful technique for verifying properties of discrete-state systems, has been extended recently to hybrid systems verification. Unlike in discrete systems, however, establishing the successor relation for hybrid systems can be a fairly expensive step since it requires evaluation and over-approximation of the continuous dynamics. It has been observed that it is often sufficient to consider fragments of counterexamples rather than complete counterexamples. In this paper we further develop the idea of fragments. We extend the notion of cut sets in directed graphs to cutting sets of fragments in abstractions. Cutting sets of fragments are then used to guide the abstraction refinement in order to prove safety properties for hybrid systems.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果