On the decidability of linear bounded periodic cyber-physical systems

DOI10.1145/3302504.3311797OpenAlexW2938200139MaRDI QIDQ5239223FDOQ5239223

Authors: Ruggero Lanotte, Massimo Merro, Fabio Mogavero 

Publication date: 22 October 2019

Published in: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

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

Recommendations

• A probabilistic calculus of cyber-physical systems
• Cyber-physical systems
• Rigorous simulation-based analysis of linear hybrid systems
• A calculus of cyber-physical systems
• scientific article; zbMATH DE number 1956650

zbMATH Keywords

reachability problemlinear cyber-physical systemsformal safety verification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

This page was built for publication: On the decidability of linear bounded periodic cyber-physical systems

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