Boundedness relations for linear constraint sets
نویسندگان
چکیده
منابع مشابه
Constraint-Based Linear-Relations Analysis
Linear-relations analysis of transition systems discovers linear invariant relationships among the variables of the system. These relationships help establish important safety and liveness properties. Efficient techniques for the analysis of systems using polyhedra have been explored, leading to the development of successful tools like HyTech. However, existing techniques rely on the use of app...
متن کاملOn Boundedness and Unboundedness of Polyhedral Estimates for Reachable Sets of Linear Differential Systems
The paper describes the properties of boundedness and unboundedness of outer polyhedral (parallelepiped-valued) estimates for reachable sets of linear differential systems with stable matrices over the infinite time interval. New results concerning tight estimates are presented.
متن کاملReceding Horizon Linear Quadratic Control with Finite Input Constraint Sets
By exploring the geometry of the underlying constrained optimization, a finitely parameterized solution to the discrete time receding horizon linear quadratic control problem with a finite input constraint set is obtained. The resulting controller gives rise to a closed loop system which is piece-wise affine in the plant state. The switching regions are polytopes and are related to those obtain...
متن کاملFeasibility and Constraint Analysis of Sets of Linear Matrix Inequalities
We present a constraint analysis methodology for Linear Matrix Inequality (LMI) constraints. If the constraint set is found to be feasible we search for a minimal representation; otherwise, we search for an irreducible infeasible system. The work is based on the solution of a set covering problem where each row corresponds to a sample point and is determined by constraint satisfaction at the sa...
متن کاملGuaranteed non-linear estimation using constraint propagation on sets
In the nonlinear case, the situation is much less developed and there are very few methods that produce such guaranteed estimates. In this paper, the discrete-time problem is cast into the more general framework of constraint satisfaction problems. Algorithms rather classical in the area of interval constraint propagation are extended by replacing intervals by more general subsets of real vecto...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1970
ISSN: 0024-3795
DOI: 10.1016/0024-3795(70)90009-1