×

zbMATH — the first resource for mathematics

Deriving unbounded reachability proof of linear hybrid automata during bounded checking procedure. (English) Zbl 1364.68266
Editorial remark: No review copy delivered.
MSC:
68Q60 Specification and verification (program logics, model checking, etc.)
68Q45 Formal languages and automata
PDF BibTeX XML Cite
Full Text: DOI