Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming

DOI10.1007/978-3-642-11319-2_9zbMath1273.68198OpenAlexW1558964573MaRDI QIDQ3656877

Jian-hua Zhao, Lei Bu, Xuandong Li

Publication date: 14 January 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11319-2_9

Mathematics Subject Classification ID

Convex programming (90C25) Formal languages and automata (68Q45)

Related Items (2)

Quantifier-free encoding of invariants for hybrid systems ⋮ Counterexample-Guided Refinement of Template Polyhedra

Uses Software

• PHAVer
• CVX
• d/dt
• BACH

This page was built for publication: Path-Oriented Reachability Verification of a Class of Nonlinear Hybrid Automata Using Convex Programming