Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking

DOI10.1007/978-3-540-72734-7_16zbMath1132.68446OpenAlexW1542723194MaRDI QIDQ5434509

No author found.

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)

Related Items

Automata-based analysis of stage suspended boom systems, Specifications for decidable hybrid games, Property Driven Three-Valued Model Checking on Hybrid Automata, Approximated Reachability on Hybrid Automata: Falsification meets Certification, Approximate equivalence of the hybrid automata with Taylor theory