Discretizing affine hybrid automata with uncertainty

DOI10.1007/978-3-642-24372-1_36zbMATH Open1348.68099OpenAlexW199864007MaRDI QIDQ3172936FDOQ3172936

Thao Dang, Thomas Martin Gawlitza

Publication date: 7 October 2011

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24372-1_36

Recommendations

• Template-based unbounded time verification of affine hybrid automata
• Hybrid abstractions of affine systems
• Space-time interpolants
• Reachability of Uncertain Nonlinear Systems Using a Nonlinear Hybridization
• Symbolic Model Checking of Hybrid Systems Using Template Polyhedra

Mathematics Subject Classification ID

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

Cited In (4)

• An automata-based view on configurability and uncertainty
• Numerical invariants through convex relaxation and max-strategy iteration
• Uniformity for the decidability of hybrid automata
• Template-Based Unbounded Time Verification of Affine Hybrid Automata

Uses Software

• SpaceEx

This page was built for publication: Discretizing affine hybrid automata with uncertainty

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