Symbolic-numeric reachability analysis of closed-loop control software
DOI10.1145/2883817.2883819zbMATH Open1364.93058OpenAlexW2342314656WikidataQ130971962 ScholiaQ130971962MaRDI QIDQ2988972FDOQ2988972
Authors: Aditya Zutshi, Sriram Sankaranarayanan, Jyotirmoy V. Deshmukh, Xiao-Qing Jin 
Publication date: 19 May 2017
Published in: Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2883817.2883819
Recommendations
- Closed loop analysis of control command software
- Verification of Supervisory Control Software Using State Proximity and Merging
- Symbolic Reachability Analysis of Lazy Linear Hybrid Automata
- On the polynomial dynamic system approach to software development
- Falsification of hybrid systems with symbolic reachability analysis and trajectory splicing
Attainable sets, reachability (93B03) Nonlinear systems in control theory (93C10) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cited In (5)
- Zur numerischen Zuverlässigkeit regelungstechnischer Analyse- und Syntheseprogramme / On numerical reliability of control engineering analysis and synthesis programs
- On minimising the maximum expected verification time
- Mining requirements from closed-loop control models
- Verification of Supervisory Control Software Using State Proximity and Merging
- Closed loop analysis of control command software
This page was built for publication: Symbolic-numeric reachability analysis of closed-loop control software
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2988972)
