An approximation algorithm for box abstraction of transition systems on real state spaces

DOI10.1007/s10703-012-0175-zzbMath1291.68261OpenAlexW1989471575MaRDI QIDQ2248056

Kunihiko Hiraishi, Koich Kobayashi

Publication date: 30 June 2014

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-012-0175-z

zbMATH Keywords

safety verificationhybrid dynamical systemspredicate abstraction

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• Kronos
• RSOLVER
• Benchmarks
• LattE
• Uppaal
• HSolver
• STeP

Cites Work

• The algorithmic analysis of hybrid systems
• Space sweep solves intersection of convex polyhedra
• Kronos: A verification tool for real-time systems
• Uppaal in a nutshell
• Counterexample-guided predicate abstraction of hybrid systems
• Effective lattice point counting in rational convex polytopes
• Integer Programming with a Fixed Number of Variables
• Computational techniques for hybrid system verification
• Hybrid Systems: Computation and Control
• Unnamed Item
• Unnamed Item

This page was built for publication: An approximation algorithm for box abstraction of transition systems on real state spaces