Counterexample-guided predicate abstraction of hybrid systems
نویسندگان
چکیده
منابع مشابه
Verification of Hybrid Systems Based on Counterexample-Guided Abstraction Refinement
Hybrid dynamic systems include both continuous and discrete state variables. Properties of hybrid systems, which have an infinite state space, can often be verified using ordinary model checking together with a finite-state abstraction. Model checking can be inconclusive, however, in which case the abstraction must be refined. This paper presents a new procedure to perform this refinement opera...
متن کاملCounter-Example Guided Predicate Abstraction of Hybrid Systems
Predicate abstraction has emerged to be a powerful technique for extracting nite-state models from in nite-state systems, and has been recently shown to enhance the e ectiveness of the reachability computation techniques for hybrid systems. Given a hybrid system with linear dynamics and a set of linear predicates, the veri er performs an on-they search of the nite discrete quotient whose states...
متن کاملCounterexample-Guided Abstraction Refinement
We present an automatic iterative abstraction-refinement methodology in which the initial abstract model is generated by an automatic analysis of the control structures in the program to be verified. Abstract models may admit erroneous (or “spurious”) counterexamples. We devise new symbolic techniques which analyze such counterexamples and refine the abstract model correspondingly. The refineme...
متن کاملCounterexample-Guided Cartesian Abstraction Refinement
Counterexample-guided abstraction refinement (CEGAR) is a method for incrementally computing abstractions of transition systems. We propose a CEGAR algorithm for computing abstraction heuristics for optimal classical planning. Starting from a coarse abstraction of the planning task, we iteratively compute an optimal abstract solution, check if and why it fails for the concrete planning task and...
متن کاملCounterexample Guided Spotlight Abstraction Refinement
This paper addresses the formal verification of distributed systems comprising a dynamically changing and potentially unbounded number of processes. We employ the spotlight principle to obtain a concise finitary abstraction of the system and devise an abstraction refinement strategy guided by the analysis of abstract counterexamples. It turns out that the key problem for spotlight refinement is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.11.026