Language-Based Abstraction Refinement for Hybrid System Verification

DOI10.1007/978-3-540-69738-1_11zbMath1132.68471OpenAlexW1576022414MaRDI QIDQ5452604

Felix Klaedtke, Stefan Ratschan, Zhikun She

Publication date: 4 April 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-69738-1_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Uses Software

• RAMAS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraint propagation with interval labels
• What's decidable about hybrid automata?
• On the expressiveness and decidability of o-minimal hybrid systems
• MONA IMPLEMENTATION SECRETS
• Counterexample-guided abstraction refinement for symbolic model checking
• Constraints for Continuous Reachability in the Verification of Hybrid Systems
• Hybrid Systems: Computation and Control
• Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control
• Formal Modeling and Analysis of Timed Systems
• Hybrid Systems: Computation and Control

This page was built for publication: Language-Based Abstraction Refinement for Hybrid System Verification