Approximated Reachability on Hybrid Automata: Falsification meets Certification

DOI10.1016/j.entcs.2008.12.030zbMath1337.68151OpenAlexW1988088997MaRDI QIDQ4982085

Kerstin Bauer, Klaus Schneider, Raffaella Gentilini

Publication date: 23 March 2015

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2008.12.030

zbMATH Keywords

hybrid automatareachability analysisabstraction-refinement

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03)

Uses Software

• RSOLVER
• HSolver

Cites Work

• CCS expressions, finite state processes, and three problems of equivalence
• A theory of timed automata
• O-minimal hybrid systems.
• Three Partition Refinement Algorithms
• Hybrid Systems: Computation and Control
• Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
• Hybrid Systems: Computation and Control
• Computer Aided Verification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item