Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming

DOI10.1016/j.entcs.2006.12.023zbMath1277.68139OpenAlexW2025886420MaRDI QIDQ2864385

Xuandong Li, Lei Bu, Sumit Jha Aanand

Publication date: 6 December 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.12.023

zbMATH Keywords

linear programmingreachability analysisbounded model checkinglinear hybrid automata

Mathematics Subject Classification ID

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

Related Items (1)

SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata

Uses Software

• PHAVer
• HyTech
• MathSAT

Cites Work

• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• HySAT: An efficient proof engine for bounded model checking of hybrid systems
• What's decidable about hybrid automata?
• HyTech: A model checker for hybrid systems
• Positive loop-closed automata: A decidable class of hybrid systems
• Algorithmic analysis of nonlinear hybrid systems
• Hybrid Systems: Computation and Control

This page was built for publication: Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming