A sound and complete proof rule for region stability of hybrid systems

Authors:
Andreas Podelski;Silke Wagner
Affiliations:
Universität Freiburg, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Year:
2007

Citing 12
Cited 6

Synthesis of Linear Ranking Functions

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Practical Methods for Proving Program Termination

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Proving that programs eventually do something good

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Model checking of hybrid systems: from reachability towards stability

HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Termination of polynomial programs

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Abstraction refinement for termination

SAS'05 Proceedings of the 12th international conference on Static Analysis

Automatic invariant generation for hybrid systems using ideal fixed points

Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
Composing reachability analyses of hybrid systems for safety and stability

ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Proving stabilization of biological systems

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Composing stability proofs for hybrid systems

FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Generating invariants of hybrid systems via sums-of-squares of polynomials with rational coefficients

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
On the decidability of stability of hybrid systems

Proceedings of the 16th international conference on Hybrid systems: computation and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

Region stability allows one to formalize hybrid systems whose trajectories may oscillate (within a given allowance) even after having 'stabilized'. Unfortunately, until today no proof rule (giving necessary and sufficient conditions for the purpose of verifying region stability) has been available. This paper fills the gap. Our (sound and complete) proof rule connects region stability with the finiteness of specific state sequences and thus with the emerging set of verification methods for program termination.