Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure

DOI10.1109/TC.2016.2604308zbMath1364.68266OpenAlexW2515014082MaRDI QIDQ5346080

Wen Xiong, Dingbao Xie, Lei Bu, Xuandong Li

Publication date: 8 June 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2016.2604308

Mathematics Subject Classification ID

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

This page was built for publication: Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure