Approximated Reachability on Hybrid Automata: Falsification meets Certification

Authors:
K. Bauer;R. Gentilini;K. Schneider
Affiliations:
Department of Computer Science, Embedded Systems Group, University of Kaiserslautern (Germany);Department of Computer Science, Embedded Systems Group, University of Kaiserslautern (Germany);Department of Computer Science, Embedded Systems Group, University of Kaiserslautern (Germany)
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 12
Cited 0

Three partition refinement algorithms

SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence

Information and Computation
A theory of timed automata

Theoretical Computer Science
What's decidable about hybrid automata?

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Computing Accumulated Delays in Real-time Systems

Formal Methods in System Design - Special issue on computer aided verification (CAV 93)
What Will Be Eventually True of Polynomial Hybrid Automata?

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Series of Abstractions for Hybrid Automata

HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computing simulations on finite and infinite graphs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Automated symbolic reachability analysis: with application to delta-notch signaling automata

HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Algorithmic algebraic model checking i: challenges from systems biology

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Safety verification of hybrid systems by constraint propagation based abstraction refinement

HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control

Quantified Score

Hi-index	0.00

Visualization

Abstract

Undecidability of the reachability problem is ubiquitous in the context of hybrid automata. Being mostly based on either bounded reachability or on the notion of simulation preorder, current techniques for the approximated reachability analysis force to choose between under- and over-approximations. In this paper, we introduce a novel method for the reachability analysis of hybrid automata featuring (1) the ability of combining the certification and the falsification of reachability properties, and (2) the applicability to highly expressive families of hybrid automata, whose dynamics are not amenable to an exact representation.