The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Languages and tools for hybrid systems design
Foundations and Trends in Electronic Design Automation
Computing Differential Invariants of Hybrid Systems as Fixedpoints
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Constraint-Based Approach for Analysis of Hybrid Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Automatic invariant generation for hybrid systems using ideal fixed points
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Synthesizing switching logic using constraint solving
International Journal on Software Tools for Technology Transfer (STTT) - VMCAI 2009
Generating polynomial invariants for hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Compositional safety analysis using barrier certificates
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
Hi-index | 0.00 |
A barrier certificate is an inductive invariant function which can be used for the safety verification of a hybrid system. Safety verification based on barrier certificate has the benefit of avoiding explicit computation of the exact reachable set which is usually intractable for nonlinear hybrid systems. In this paper, we propose a new barrier certificate condition, called Exponential Condition, for the safety verification of semi-algebraic hybrid systems. The most important benefit of Exponential Condition is that it has a lower conservativeness than the existing convex conditions and meanwhile it possesses the convexity. On the one hand, a less conservative barrier certificate forms a tighter over-approximation for the reachable set and hence is able to verify critical safety properties. On the other hand, the convexity guarantees its solvability by semidefinite programming method. Some examples are presented to illustrate the effectiveness and practicality of our method.