Series of Abstractions for Hybrid Automata
نویسندگان
چکیده
We present a technique based on the use of the quantifier elimination decision procedure for real closed fields and simple theorem proving to construct a series of successively finer qualitative abstractions of hybrid automata. The resulting abstractions are always discrete transition systems which can then be used by any traditional analysis tool. The constructed abstractions are conservative and can be used to establish safety properties of the original system. Our technique works on linear and non-linear polynomial hybrid systems, that is, the guards on discrete transitions and the continuous flows in all modes can be specified using arbitrary polynomial expressions over the continuous variables. We have a prototype tool in the SAL environment [13] which is built over the theorem prover PVS [19]. The technique promises to scale well to large and complex hybrid systems.
منابع مشابه
Series of Abstractions of Hybrid Automata for Monotonic CTL Model Checking
Current symbolic techniques for the automated reasoning on undecidable hybrid automata, force to choose between the refinement of either an overapproximation or an underapproximation of the set of reachable states. When the analysis of branching temporal properties is considered, the literature has developed a number of abstractions techniques based on the simulation preorder, that allow the pr...
متن کاملSuccessive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
Current symbolic techniques for the automated reasoning over undecidable hybrid automata, force one to choose between the refinement of either an overapproximation or an underapproximation of the set of reachable states. When the analysis of branching time temporal properties is considered, the literature has developed a number of abstractions techniques based on the simulation preorder, that a...
متن کاملAbstractions for hybrid systems
ions for Hybrid Systems ∗ Ashish Tiwari ([email protected]) SRI International, 333 Ravenswood Ave, Menlo Park, CA, U.S.A Abstract. We present a procedure for constructing sound finite-state discrete abstractions of hybrid systems. This procedure uses ideas from predicate abstraction to abstract the discrete dynamics and qualitative reasoning to abstract the continuous dynamics of the hybrid sy...
متن کاملHybrid Automata-Based CEGAR for Rectangular Hybrid Systems
In this paper we present a framework for carrying out counterexample guided abstraction-refinement (CEGAR) for systems modelled as rectangular hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we consider the abstractions to be hybrid automata as well. We show that the CEGAR scheme is semi-complete for the class of rectangul...
متن کاملHybrid Automata-based CEGAR for Hybrid Systems
In this paper we present a framework for carrying out counterexample guided abstraction-refinement (CEGAR) for systems modelled as hybrid automata. The main difference, between our approach and previous proposals for CEGAR for hybrid automata, is that we consider the abstractions to be hybrid automata as well. We present a counterexample guided abstraction refinement method for systems modelled...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002