scispace - formally typeset
Search or ask a question
Conference

International Conference on Hybrid Systems: computation and control 

About: International Conference on Hybrid Systems: computation and control is an academic conference. The conference publishes majorly in the area(s): Hybrid system & Reachability. Over the lifetime, 629 publications have been published by the conference receiving 18527 citations.


Papers
More filters
Book ChapterDOI
30 Apr 2009
TL;DR: This work presents a semi-definite programming based solution for solving the problem of security constrained optimal control for discrete-time, linear dynamical systems in which control and measurement packets are transmitted over a communication network.
Abstract: We consider the problem of security constrained optimal control for discrete-time, linear dynamical systems in which control and measurement packets are transmitted over a communication network. The packets may be jammed or compromised by a malicious adversary. For a class of denial-of-service (DoS) attack models, the goal is to find an (optimal) causal feedback controller that minimizes a given objective function subject to safety and power constraints. We present a semi-definite programming based solution for solving this problem. Our analysis also presents insights on the effect of attack models on solution of the optimal control problem.

676 citations

Book ChapterDOI
09 Mar 2005
TL;DR: The main innovation of the method consists in the use of zonotopes for reachable set representation, which has been used to treat several examples and has shown great performances for high dimensional systems.
Abstract: We present a method for the computation of reachable sets of uncertain linear systems. The main innovation of the method consists in the use of zonotopes for reachable set representation. Zonotopes are special polytopes with several interesting properties : they can be encoded efficiently, they are closed under linear transformations and Minkowski sum. The resulting method has been used to treat several examples and has shown great performances for high dimensional systems. An extension of the method for the verification of piecewise linear hybrid systems is proposed.

614 citations

Book ChapterDOI
09 Mar 2005
TL;DR: This work addresses the main problems of HyTech with PHAVer, a new tool for the exact verification of safety properties of hybrid systems with piecewise constant bounds on the derivatives and proposes methods to conservatively limit the number of bits and constraints of polyhedra.
Abstract: In 1995, HyTech broke new ground as a potentially powerful tool for verifying hybrid systems – yet it has remained severely limited in its applicability to more complex systems. We address the main problems of HyTech with PHAVer, a new tool for the exact verification of safety properties of hybrid systems with piecewise constant bounds on the derivatives. Affine dynamics are handled by on-the-fly overapproximation and by partitioning the state space based on user-definable constraints and the dynamics of the system. PHAVer's exact arithmetic is robust due to the use of the Parma Polyhedra Library, which supports arbitrarily large numbers. To manage the complexity of the polyhedral computations, we propose methods to conservatively limit the number of bits and constraints of polyhedra. Experimental results for a navigation benchmark and a tunnel diode circuit show the effectiveness of the approach.

560 citations

Book ChapterDOI
03 Apr 2003
TL;DR: This work analyzes the observability of the continuous and discrete states of continuous-time linear hybrid systems and derives weaker rank conditions that are sufficient to guarantee the uniqueness of the reconstruction of the state trajectory, even when the individual linear systems are unobservable.
Abstract: We analyze the observability of the continuous and discrete states of continuous-time linear hybrid systems. For the class of jump-linear systems, we derive necessary and sufficient conditions that the structural parameters of the model must satisfy in order for filtering and smoothing algorithms to operate correctly. Our conditions are simple rank tests that exploit the geometry of the observability subspaces. For linear hybrid systems, we derive weaker rank conditions that are sufficient to guarantee the uniqueness of the reconstruction of the state trajectory, even when the individual linear systems are unobservable.

268 citations

Proceedings ArticleDOI
14 Apr 2015
TL;DR: A counterexample-guided inductive synthesis approach to controller synthesis for cyber-physical systems subject to signal temporal logic (STL) specifications, operating in potentially adversarial nondeterministic environments is presented.
Abstract: We present a counterexample-guided inductive synthesis approach to controller synthesis for cyber-physical systems subject to signal temporal logic (STL) specifications, operating in potentially adversarial nondeterministic environments. We encode STL specifications as mixed integer-linear constraints on the variables of a discrete-time model of the system and environment dynamics, and solve a series of optimization problems to yield a satisfying control sequence. We demonstrate how the scheme can be used in a receding horizon fashion to fulfill properties over unbounded horizons, and present experimental results for reactive controller synthesis for case studies in building climate control and autonomous driving.

251 citations

Performance
Metrics
No. of papers from the Conference in previous years
YearPapers
202322
202234
202134
202032
201838
201731