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

DOI10.1109/TC.2016.2604308MaRDI QIDQ5346080zbMATH OpenOpenAlexFDO

Authors Dingbao Xie, Wen Xiong, 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)

Recommendations

• Reachability for Linear Hybrid Automata Using Iterative Relaxation Abstraction
• scientific article; zbMATH DE number 1852175
• Verification, Model Checking, and Abstract Interpretation
• On reachability for hybrid automata over bounded time
• Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata
• Verification of Bounded Discrete Horizon Hybrid Automata
• Reachability Problems for Hybrid Automata
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata

Cited in

(2)

• Computing bounded ε-reach set with finite precision computations for a class of linear hybrid automata
• Model checking fuzzy computation tree logic of multi-agent systems based on fuzzy interpreted systems

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

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