{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T19:50:49Z","timestamp":1776887449517,"version":"3.51.2"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031453281","type":"print"},{"value":"9783031453298","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45329-8_17","type":"book-chapter","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T18:02:40Z","timestamp":1697911360000},"page":"357-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Learning Provably Stabilizing Neural Controllers for\u00a0Discrete-Time Stochastic Systems"],"prefix":"10.1007","author":[{"given":"Matin","family":"Ansaripour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4561-241X","authenticated-orcid":false,"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2985-7724","authenticated-orcid":false,"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6117-0076","authenticated-orcid":false,"given":"Mathias","family":"Lechner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4681-1699","authenticated-orcid":false,"given":"\u0110or\u0111e","family":"\u017dikeli\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/LCSYS.2020.3005328","volume":"5","author":"A Abate","year":"2021","unstructured":"Abate, A., Ahmed, D., Giacobbe, M., Peruffo, A.: Formal synthesis of Lyapunov neural networks. IEEE Control. Syst. Lett. 5(3), 773\u2013778 (2021). https:\/\/doi.org\/10.1109\/LCSYS.2020.3005328","journal-title":"IEEE Control. Syst. Lett."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-81688-9_1","volume-title":"Computer Aided Verification","author":"A Abate","year":"2021","unstructured":"Abate, A., Giacobbe, M., Roy, D.: Learning probabilistic termination proofs. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12760, pp. 3\u201326. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81688-9_1"},{"key":"17_CR3","unstructured":"Achiam, J., Held, D., Tamar, A., Abbeel, P.: Constrained policy optimization. In: International Conference on Machine Learning, pp. 22\u201331. PMLR (2017)"},{"key":"17_CR4","unstructured":"Altman, E.: Constrained Markov Decision Processes, vol. 7. CRC Press (1999)"},{"key":"17_CR5","unstructured":"Amodei, D., Olah, C., Steinhardt, J., Christiano, P.F., Schulman, J., Man\u00e9, D.: Concrete problems in AI safety. CoRR abs\/1606.06565 (2016). https:\/\/arxiv.org\/abs\/1606.06565"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Ansaripour, M., Chatterjee, K., Henzinger, T.A., Lechner, M., Zikelic, D.: Learning provably stabilizing neural controllers for discrete-time stochastic systems. CoRR abs\/2210.05304 (2022). https:\/\/doi.org\/10.48550\/arXiv.2210.05304","DOI":"10.48550\/arXiv.2210.05304"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1613\/jair.1.14253","volume":"76","author":"TS Badings","year":"2023","unstructured":"Badings, T.S., et al.: Robust control for dynamical systems with non-gaussian noise via formal abstractions. J. Artif. Intell. Res. 76, 341\u2013391 (2023). https:\/\/doi.org\/10.1613\/jair.1.14253","journal-title":"J. Artif. Intell. Res."},{"key":"17_CR8","unstructured":"Berkenkamp, F., Turchetta, M., Schoellig, A.P., Krause, A.: Safe model-based reinforcement learning with stability guarantees. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, Long Beach, CA, USA, 4\u20139 December 2017, pp. 908\u2013918 (2017). https:\/\/proceedings.neurips.cc\/paper\/2017\/hash\/766ebcd59621e305170616ba3d3dac32-Abstract.html"},{"key":"17_CR9","unstructured":"Brockman, G., et al.: OpenAI gym. arXiv preprint arXiv:1606.01540 (2016)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Cauchi, N., Abate, A.: Stochy-automated verification and synthesis of stochastic processes. In: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, pp. 258\u2013259 (2019)","DOI":"10.1145\/3302504.3313349"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/978-3-642-39799-8_34","volume-title":"Computer Aided Verification","author":"A Chakarov","year":"2013","unstructured":"Chakarov, A., Sankaranarayanan, S.: Probabilistic program analysis with martingales. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 511\u2013526. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_34"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-662-49674-9_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Chakarov","year":"2016","unstructured":"Chakarov, A., Voronin, Y.-L., Sankaranarayanan, S.: Deductive proofs of almost sure persistence and recurrence properties. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 260\u2013279. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_15"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/3-540-55719-9_97","volume-title":"Automata, Languages and Programming","author":"E Chang","year":"1992","unstructured":"Chang, E., Manna, Z., Pnueli, A.: Characterization of temporal property classes. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 474\u2013486. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_97"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Chang, Y., Gao, S.: Stabilizing neural control using self-learned almost Lyapunov critics. In: IEEE International Conference on Robotics and Automation, ICRA 2021, Xi\u2019an, China, 30 May\u20135 June 2021, pp. 1803\u20131809. IEEE (2021). https:\/\/doi.org\/10.1109\/ICRA48506.2021.9560886","DOI":"10.1109\/ICRA48506.2021.9560886"},{"key":"17_CR15","unstructured":"Chang, Y., Roohi, N., Gao, S.: Neural Lyapunov control. In: Wallach, H.M., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E.B., Garnett, R. (eds.) Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, Vancouver, BC, Canada, 8\u201314 December 2019, pp. 3240\u20133249 (2019). https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/2647c1dba23bc0e0f9cdf75339e120d2-Abstract.html"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-41528-4_1","volume-title":"Computer Aided Verification","author":"K Chatterjee","year":"2016","unstructured":"Chatterjee, K., Fu, H., Goharshady, A.K.: Termination analysis of probabilistic programs through Positivstellensatz\u2019s. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 3\u201322. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_1"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Fu, H., Novotn\u00fd, P., Hasheminezhad, R.: Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In: Bod\u00edk, R., Majumdar, R. (eds.) Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, 20\u201322 January 2016, pp. 327\u2013342. ACM (2016). https:\/\/doi.org\/10.1145\/2837614.2837639","DOI":"10.1145\/2837614.2837639"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-031-13185-1_4","volume-title":"Computer Aided Verification","author":"K Chatterjee","year":"2022","unstructured":"Chatterjee, K., Goharshady, A.K., Meggendorfer, T., Zikelic, D.: Sound and complete certificates for quantitative termination analysis of probabilistic programs. In: Shoham, S., Vizel, Y. (eds.) CAV 2022. LNCS, vol. 13371, pp. 55\u201378. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-13185-1_4"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-030-90870-6_33","volume-title":"Formal Methods","author":"K Chatterjee","year":"2021","unstructured":"Chatterjee, K., Goharshady, E.K., Novotn\u00fd, P., Z\u00e1rev\u00facky, J., \u017dikeli\u0107, \u0110: On lexicographic proof rules for probabilistic termination. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 619\u2013639. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_33"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Novotn\u00fd, P., Zikelic, D.: Stochastic invariants for probabilistic termination. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 145\u2013160. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009873","DOI":"10.1145\/3009837.3009873"},{"key":"17_CR21","unstructured":"Chow, Y., Nachum, O., Du\u00e9\u00f1ez-Guzm\u00e1n, E.A., Ghavamzadeh, M.: A Lyapunov-based approach to safe reinforcement learning. In: Bengio, S., Wallach, H.M., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, Montr\u00e9al, Canada, 3\u20138 December 2018, pp. 8103\u20138112 (2018). https:\/\/proceedings.neurips.cc\/paper\/2018\/hash\/4fe5149039b52765bde64beb9f674940-Abstract.html"},{"key":"17_CR22","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Graham, R.M., Harrison, M.A., Sethi, R. (eds.) Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, Los Angeles, California, USA, January 1977, pp. 238\u2013252. ACM (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"issue":"12","key":"17_CR23","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1016\/S0005-1098(03)00238-3","volume":"39","author":"LG Crespo","year":"2003","unstructured":"Crespo, L.G., Sun, J.: Stochastic optimal control via Bellman\u2019s principle. Automatica 39(12), 2109\u20132114 (2003). https:\/\/doi.org\/10.1016\/S0005-1098(03)00238-3","journal-title":"Automatica"},{"key":"17_CR24","unstructured":"Dalal, G., Dvijotham, K., Vecer\u00edk, M., Hester, T., Paduraru, C., Tassa, Y.: Safe exploration in continuous action spaces. arXiv abs\/1801.08757 (2018)"},{"key":"17_CR25","unstructured":"Garc\u00eda, J., Fern\u00e1ndez, F.: A comprehensive survey on safe reinforcement learning. J. Mach. Learn. Res. 16, 1437\u20131480 (2015). https:\/\/dl.acm.org\/citation.cfm?id=2886795"},{"key":"17_CR26","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1007\/11871842_63","volume-title":"Machine Learning: ECML 2006","author":"P Geibel","year":"2006","unstructured":"Geibel, P.: Reinforcement learning for MDPs with constraints. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 646\u2013653. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_63"},{"key":"17_CR27","unstructured":"Gowal, S., et al.: On the effectiveness of interval bound propagation for training verifiably robust models. CoRR abs\/1810.12715 (2018). https:\/\/arxiv.org\/abs\/1810.12715"},{"key":"17_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/b96977","volume-title":"Positive Polynomials in Control","author":"D Henrion","year":"2005","unstructured":"Henrion, D., Garulli, A.: Positive Polynomials in Control, vol. 312. Springer, Heidelberg (2005)"},{"key":"17_CR29","unstructured":"Jin, W., Wang, Z., Yang, Z., Mou, S.: Neural certificates for safe control policies. CoRR abs\/2006.08465 (2020). https:\/\/arxiv.org\/abs\/2006.08465"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-63387-9_5","volume-title":"Computer Aided Verification","author":"G Katz","year":"2017","unstructured":"Katz, G., Barrett, C., Dill, D.L., Julian, K., Kochenderfer, M.J.: Reluplex: an efficient SMT solver for verifying deep neural networks. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 97\u2013117. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_5"},{"key":"17_CR31","unstructured":"Khalil, H.: Nonlinear Systems. Pearson Education, Prentice Hall (2002)"},{"key":"17_CR32","doi-asserted-by":"crossref","unstructured":"Koller, T., Berkenkamp, F., Turchetta, M., Krause, A.: Learning-based model predictive control for safe exploration. In: 2018 IEEE Conference on Decision and Control (CDC), pp. 6059\u20136066 (2018)","DOI":"10.1109\/CDC.2018.8619572"},{"issue":"1","key":"17_CR33","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1073\/pnas.53.1.8","volume":"53","author":"HJ Kushner","year":"1965","unstructured":"Kushner, H.J.: On the stability of stochastic dynamical systems. Proc. Natl. Acad. Sci. U.S.A. 53(1), 8 (1965)","journal-title":"Proc. Natl. Acad. Sci. U.S.A."},{"issue":"2","key":"17_CR34","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.automatica.2013.10.013","volume":"50","author":"HJ Kushner","year":"2014","unstructured":"Kushner, H.J.: A partial history of the early development of continuous-time nonlinear stochastic systems theory. Automatica 50(2), 303\u2013334 (2014). https:\/\/doi.org\/10.1016\/j.automatica.2013.10.013","journal-title":"Automatica"},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-030-53291-8_24","volume-title":"Computer Aided Verification","author":"A Lavaei","year":"2020","unstructured":"Lavaei, A., Khaled, M., Soudjani, S., Zamani, M.: AMYTISS: parallelized automated controller synthesis for large-scale stochastic systems. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12225, pp. 461\u2013474. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_24"},{"key":"17_CR36","unstructured":"Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T.A.: Infinite time horizon safety of Bayesian neural networks. In: Ranzato, M., Beygelzimer, A., Dauphin, Y.N., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, 6\u201314 December 2021, Virtual, pp. 10171\u201310185 (2021). https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/544defa9fddff50c53b71c43e0da72be-Abstract.html"},{"key":"17_CR37","doi-asserted-by":"crossref","unstructured":"Lechner, M., Zikelic, D., Chatterjee, K., Henzinger, T.A.: Stability verification in stochastic control systems via neural network supermartingales. In: Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, 22 February\u20131 March 2022, pp. 7326\u20137336. AAAI Press (2022). https:\/\/ojs.aaai.org\/index.php\/AAAI\/article\/view\/20695","DOI":"10.1609\/aaai.v36i7.20695"},{"key":"17_CR38","unstructured":"Liu, A., Shi, G., Chung, S.J., Anandkumar, A., Yue, Y.: Robust regression for safe exploration in control. In: L4DC (2020)"},{"key":"17_CR39","unstructured":"Murphy, K.P.: Machine Learning - A Probabilistic Perspective. Adaptive Computation and Machine Learning Series. MIT Press (2012)"},{"key":"17_CR40","unstructured":"Parrilo, P.A.: Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. California Institute of Technology (2000)"},{"key":"17_CR41","doi-asserted-by":"publisher","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics. Wiley (1994). https:\/\/doi.org\/10.1002\/9780470316887","DOI":"10.1002\/9780470316887"},{"key":"17_CR42","unstructured":"Richards, S.M., Berkenkamp, F., Krause, A.: The Lyapunov neural network: adaptive stability certification for safe learning of dynamical systems. In: 2nd Annual Conference on Robot Learning, CoRL 2018, Z\u00fcrich, Switzerland, 29\u201331 October 2018, Proceedings. Proceedings of Machine Learning Research, vol. 87, pp. 466\u2013476. PMLR (2018). https:\/\/proceedings.mlr.press\/v87\/richards18a.html"},{"key":"17_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-89716-1_10","volume-title":"Reachability Problems","author":"M S\u00e4lzer","year":"2021","unstructured":"S\u00e4lzer, M., Lange, M.: Reachability is NP-complete even for the simplest neural networks. In: Bell, P.C., Totzke, P., Potapov, I. (eds.) RP 2021. LNCS, vol. 13035, pp. 149\u2013164. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89716-1_10"},{"key":"17_CR44","unstructured":"Schulman, J., Wolski, F., Dhariwal, P., Radford, A., Klimov, O.: Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)"},{"key":"17_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-662-46681-0_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"SEZ Soudjani","year":"2015","unstructured":"Soudjani, S.E.Z., Gevaerts, C., Abate, A.: FAUST$$^2$$: formal abstractions of uncountable-state stochastic processes. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 272\u2013286. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_23"},{"key":"17_CR46","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)"},{"key":"17_CR47","unstructured":"Szegedy, C., et al.: Intriguing properties of neural networks. In: Bengio, Y., LeCun, Y. (eds.) 2nd International Conference on Learning Representations, ICLR 2014, Banff, AB, Canada, 14\u201316 April 2014, Conference Track Proceedings (2014). https:\/\/arxiv.org\/abs\/1312.6199"},{"key":"17_CR48","doi-asserted-by":"publisher","unstructured":"Takisaka, T., Oyabu, Y., Urabe, N., Hasuo, I.: Ranking and repulsing supermartingales for reachability in randomized programs. ACM Trans. Program. Lang. Syst. 43(2), 5:1\u20135:46 (2021). https:\/\/doi.org\/10.1145\/3450967","DOI":"10.1145\/3450967"},{"key":"17_CR49","unstructured":"Turchetta, M., Berkenkamp, F., Krause, A.: Safe exploration for interactive machine learning. In: NeurIPS (2019)"},{"key":"17_CR50","doi-asserted-by":"crossref","unstructured":"Uchibe, E., Doya, K.: Constrained reinforcement learning from intrinsic and extrinsic rewards. In: 2007 IEEE 6th International Conference on Development and Learning, pp. 163\u2013168. IEEE (2007)","DOI":"10.1109\/DEVLRN.2007.4354030"},{"key":"17_CR51","doi-asserted-by":"publisher","unstructured":"Vaidya, U.: Stochastic stability analysis of discrete-time system using Lyapunov measure. In: American Control Conference, ACC 2015, Chicago, IL, USA, 1\u20133 July 2015, pp. 4646\u20134651. IEEE (2015). https:\/\/doi.org\/10.1109\/ACC.2015.7172061","DOI":"10.1109\/ACC.2015.7172061"},{"key":"17_CR52","doi-asserted-by":"publisher","unstructured":"Van Huijgevoort, B., Sch\u00f6n, O., Soudjani, S., Haesaert, S.: SySCoRe: synthesis via stochastic coupling relations. In: Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2023. Association for Computing Machinery (2023). https:\/\/doi.org\/10.1145\/3575870.3587123","DOI":"10.1145\/3575870.3587123"},{"key":"17_CR53","doi-asserted-by":"publisher","unstructured":"Vinod, A.P., Gleason, J.D., Oishi, M.M.K.: SReachTools: a MATLAB stochastic reachability toolbox. In: Ozay, N., Prabhakar, P. (eds.) Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, HSCC 2019, Montreal, QC, Canada, 16\u201318 April 2019, pp. 33\u201338. ACM (2019). https:\/\/doi.org\/10.1145\/3302504.3311809","DOI":"10.1145\/3302504.3311809"},{"key":"17_CR54","unstructured":"Williams, D.: Probability with Martingales. Cambridge Mathematical Textbooks. Cambridge University Press (1991)"},{"key":"17_CR55","doi-asserted-by":"publisher","unstructured":"Zikelic, D., Lechner, M., Chatterjee, K., Henzinger, T.A.: Learning stabilizing policies in stochastic control systems. CoRR abs\/2205.11991 (2022). https:\/\/doi.org\/10.48550\/arXiv.2205.11991","DOI":"10.48550\/arXiv.2205.11991"},{"key":"17_CR56","doi-asserted-by":"publisher","unstructured":"Zikelic, D., Lechner, M., Henzinger, T.A., Chatterjee, K.: Learning control policies for stochastic systems with reach-avoid guarantees. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 10, pp. 11926\u201311935 (2023). https:\/\/doi.org\/10.1609\/aaai.v37i10.26407","DOI":"10.1609\/aaai.v37i10.26407"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45329-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T18:04:53Z","timestamp":1697911493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45329-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453281","9783031453298"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45329-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"115","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.05","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7 tool papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}