Eliminating spurious transitions in reachability with support functions

DOI10.1145/2728606.2728622zbMath1364.93056OpenAlexW2012592827WikidataQ62037219 ScholiaQ62037219MaRDI QIDQ2988931

Marius Greitschus, Thomas Strump, Andreas Podelski, Goran Frehse, Sergiy Bogomolov

Publication date: 19 May 2017

Published in: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2728606.2728622

zbMATH Keywords

verificationhybrid systemsreachabilitytools

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Attainable sets, reachability (93B03) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (4)

Symbolic analysis of linear hybrid automata -- 25 years later ⋮ Fully-Automated Verification of Linear Systems Using Reachability Analysis with Support Functions ⋮ Counterexample-Guided Refinement of Template Polyhedra ⋮ Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version)

Uses Software

• SpaceEx

Cites Work

• Unnamed Item
• Unnamed Item
• On Fixed Points of Strictly Causal Functions
• Requirements for hybrid cosimulation standards
• THEORY OF QUANTIZED SYSTEMS: DEVS SIMULATION OF PERCEIVING AGENTS
• Hybrid Systems: Computation and Control

This page was built for publication: Eliminating spurious transitions in reachability with support functions