Hybrid Systems Verification by Location Elimination

Authors:
Andreas Nonnengart
Affiliations:
-
Venue:
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Year:
2000

Citing 8
Cited 2

A theory of timed automata

Theoretical Computer Science
The algorithmic analysis of hybrid systems

Theoretical Computer Science - Special issue on hybrid systems
Automatic Symbolic Verification of Embedded Systems

IEEE Transactions on Software Engineering
Hybrid Systems

Hybrid Systems
Hybrid Systems II

Hybrid Systems II
Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems

Hybrid Systems
Logics and Models of Real Time: A Survey

Proceedings of the Real-Time: Theory in Practice, REX Workshop
The theory of hybrid automata

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

Superposition-based analysis of first-order probabilistic timed automata

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Finite Reasons for Safety

Journal of Automated Reasoning

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we propose a verification method for hybrid systems that is based on a successive elimination of the various system locations involved. Briefly, with each such elimination we compute a weakest precondition (strongest postcondition) on the predecessor (successor) locations such that the property to be proved cannot be violated. Experiments show that this approach is particularly interesting in cases where a standard reachability analysis would require to travel often through some of the given system locations.