Results 1 - 10
of
14
Synthesis of quantized feedback control software for discrete time linear hybrid systems
, 2010
"... Abstract. We present an algorithm that given a Discrete Time Linear Hybrid System H returns a correct-by-construction software implemen-tation K for a (near time optimal) robust quantized feedback controller for H along with the set of states on which K is guaranteed to work cor-rectly (controllable ..."
Abstract
-
Cited by 16 (15 self)
- Add to MetaCart
(Show Context)
Abstract. We present an algorithm that given a Discrete Time Linear Hybrid System H returns a correct-by-construction software implemen-tation K for a (near time optimal) robust quantized feedback controller for H along with the set of states on which K is guaranteed to work cor-rectly (controllable region). Furthermore, K has a Worst Case Execution Time linear in the number of bits of the quantization schema. 1
Exact state set representations in the verification of linear hybrid systems with large discrete state space
- In Automated Technology for Verification and Analysis, ATVA’07, volume 4762 of LNCS
, 2007
"... Copyright c © June 2007 by the author(s) ..."
(Show Context)
CalCS: SMT Solving for Non-Linear Convex Constraints”, FMCAD
, 2010
"... Abstract—Certain formal verification tasks require reasoning about Boolean combinations of non-linear arithmetic constraints over the real numbers. In this paper, we present a new technique for satisfiability solving of Boolean combinations of non-linear constraints that are convex. Our approach app ..."
Abstract
-
Cited by 7 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Certain formal verification tasks require reasoning about Boolean combinations of non-linear arithmetic constraints over the real numbers. In this paper, we present a new technique for satisfiability solving of Boolean combinations of non-linear constraints that are convex. Our approach applies fundamental results from the theory of convex programming to realize a satisfiability modulo theory (SMT) solver. Our solver, CalCS, uses a lazy combination of SAT and a theory solver. A key step in our algorithm is the use of complementary slackness and duality theory to generate succinct infeasibility proofs that support conflict-driven learning. Moreover, whenever non-convex constraints are produced from Boolean reasoning, we provide a procedure that generates conservative approximations of the original set of constraints by using geometric properties of convex sets and supporting hyperplanes. We validate CalCS on several benchmarks including formulas generated from bounded model checking of hybrid automata and static analysis of floating-point software. I.
A.: Towards component based design of hybrid systems: Safety and stability
- Essays in Memory of Amir Pnueli. Volume 6200 of Lecture Notes in Computer Science
, 2010
"... Abstract. We propose a library based incremental design methodology for constructing hybrid controllers from a component library of models of hybrid controllers, such that global safety and stability properties are preserved. To this end, we propose hybrid interface specifications of components char ..."
Abstract
-
Cited by 3 (3 self)
- Add to MetaCart
Abstract. We propose a library based incremental design methodology for constructing hybrid controllers from a component library of models of hybrid controllers, such that global safety and stability properties are preserved. To this end, we propose hybrid interface specifications of components characterizing plant regions for which safety and stability properties are guaranteed, as well as exception mechanisms allowing safe and stability-preserving transfer of control whenever the plant evolves towards the boundary of controllable dynamics. We then propose a composition operatorforconstructinghybrid automatafromalibraryofsuch pre-characterized components supported by compositional and automatable proofs of hybrid interface specifications. 1
Using Bit-Vector Decision Procedures for Analysis of Protein Folding Pathways
"... Abstract. We explore the use of bit-vector decision procedures for the analysis of protein folding pathways. We argue that the protein folding problem is not identical to the classical probabilistic model checking problem in verification. Motivated by the different nature of the protein folding prob ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract. We explore the use of bit-vector decision procedures for the analysis of protein folding pathways. We argue that the protein folding problem is not identical to the classical probabilistic model checking problem in verification. Motivated by the different nature of the protein folding problem, we present a translation of the protein folding pathways analysis problem into a bounded model checking framework with bit vector decision procedures. We also present initial results of our experiments using the UCLID bit-vector decision procedure. 1
Decision Procedure Based Discovery of Rare Behaviors in Stochastic Differential Equation Models of Biological Systems
"... Abstract—Stochastic Differential Equation (SDE) models are often used to model the dynamics of complex biological systems. The stochastic nature of these models means that some behaviors are more likely than others. It is often the case that a model’s primary purpose is to study rare but interesting ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Stochastic Differential Equation (SDE) models are often used to model the dynamics of complex biological systems. The stochastic nature of these models means that some behaviors are more likely than others. It is often the case that a model’s primary purpose is to study rare but interesting or important behaviors, such as the formation of a tumor, or the failure of a cyber-physical system. Unfortunately, due to the limited availability of analytic methods for SDEs, stochastic simulations are the most common means for estimating (or bounding) the probability of rare behaviors. Naturally, the cost of stochastic simulations increases with the rarity of the behavior under consideration. To address this problem, we introduce a new algorithm, RESERCHE, that is specifically designed to quantify the likelihood of rare but interesting behaviors in SDE models. Our approach relies on the use
/WNVK4QDQV 5[UVGOU /QFGNKPI 5RGEKſECVKQP CPF /QFGN %JGEMKPI 0 Multi-Robot Systems: Modeling, Specification, and Model Checking
"... ..."
(Show Context)
Modeling Verification Strategies Bit-Level Tool
"... – UCLID modeling language – Generating models from code ..."
(Show Context)
permission. Reachability Analysis of Lazy Linear Hybrid Automata
"... All rights reserved. ..."
(Show Context)
Random Relaxation Abstractions for Bounded Reachability Analysis of Linear Hybrid Automata
, 2008
"... The state of the art in the validation of linear hybrid automata has been restricted to systems with tens of variables because of the extremely high computational complexity of manipulating polyhedra in high dimensions. In this paper, we present a distributed algorithm that constructs low dimension ..."
Abstract
- Add to MetaCart
(Show Context)
The state of the art in the validation of linear hybrid automata has been restricted to systems with tens of variables because of the extremely high computational complexity of manipulating polyhedra in high dimensions. In this paper, we present a distributed algorithm that constructs low dimensional randomized over-approximate relaxation abstractions of linear hybrid automata and analyzes these low dimensional hybrid automata to perform bounded model checking of the original high dimensional linear hybrid automata. Our algorithm relies on the feasibility preserving nature of random linear relaxations and the Johnson Lindenstrauss lemma to show that random relaxations preserve the infeasibility of linear constraints with a nonzero probability.
