×

Poster abstract: Data-driven correct-by-design control of parametric stochastic systems. (English) Zbl 07807963

Proceedings of the 26th ACM international conference on hybrid systems: computation and control, HSCC 2023, part of the 16th CPS-IoT week, San Antonio, TX, USA, May 9–12, 2023. New York, NY: Association for Computing Machinery (ACM). Paper No. 22, 2 p. (2023).

MSC:

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

References:

[1] Sofie Haesaert and Sadegh Soudjani. 2020. Robust dynamic programming for temporal logic control of stochastic systems. IEEE Trans. Automat. Control 66, 6 (2020), 2496-2511. · Zbl 1467.93292
[2] Sofie Haesaert, Paul MJ Van den Hof, and Alessandro Abate. 2017. Data-driven and model-based verification via Bayesian identification and reachability analysis. Automatica 79 (2017), 115-126. · Zbl 1371.93187
[3] Abolfazl Lavaei, Sadegh Soudjani, Alessandro Abate, and Majid Zamani. 2022. Automated verification and synthesis of stochastic hybrid systems: A survey. Automatica 146 (2022), 110617. · Zbl 1504.93389
[4] Oliver Schön, Birgit van Huijgevoort, Sofie Haesaert, and Sadegh Soudjani. 2022. Correct-by-Design Control of Parametric Stochastic Systems. In 2022 IEEE 61st Conference on Decision and Control (CDC). IEEE, 5580-5587.
[5] Birgit C van Huijgevoort and Sofie Haesaert. 2022. Similarity quantification for linear stochastic systems: A coupling compensator approach. Automatica 144 (2022), 110476. · Zbl 1500.93133
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.