Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking

DOI10.1007/978-3-540-72734-7_16MaRDI QIDQ5434509zbMATH OpenOpenAlexFDO

Authors

Publication date 4 January 2008

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72734-7_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 2085344
• Abstraction and Counterexample-Guided Refinement in Model Checking of Hybrid Systems
• Abstraction and abstraction refinement
• scientific article; zbMATH DE number 2110619
• Abstraction for branching time properties.

Cited in

(9)

• Approximate equivalence of the hybrid automata with Taylor theory
• Automata-based analysis of stage suspended boom systems
• Monotonic hybrid systems
• Property Driven Three-Valued Model Checking on Hybrid Automata
• scientific article; zbMATH DE number 2085344 (Why is no real title available?)
• Approximated reachability on hybrid automata: falsification meets certification
• Tools and Algorithms for the Construction and Analysis of Systems
• Hybrid Systems: Computation and Control
• Specifications for decidable hybrid games

This page was built for publication: Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434509)