Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata

DOI10.1145/1967701.1967714zbMath1361.68141OpenAlexW2056195475MaRDI QIDQ2986715

Viorica Sofronie-Stokkermans, Werner Damm, Carsten Ihlemann

Publication date: 16 May 2017

Published in: Proceedings of the 14th international conference on Hybrid systems: computation and control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1967701.1967714

zbMATH Keywords

verificationcomplexityhybrid systemshybrid automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

This page was built for publication: Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata