{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T14:45:44Z","timestamp":1786113944202,"version":"3.56.0"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NSF Safe Learning Enabled Systems"},{"name":"DARPA Assured Autonomy, Assured Neuro-Symbolic Reasoning (ANSR), and Transfer from Imprecise and Abstract Models to Autonomous Technologies (TIAMAT) programs"},{"name":"National Aeronautics and Space Administration University Leadership Initiative (NASA ULI) Safe Aviation Autonomy program"},{"DOI":"10.13039\/100023581","name":"NSF Graduate Research Fellowship Program","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100023581","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Oden Institute Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/lcsys.2026.3717040","type":"journal-article","created":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T19:10:59Z","timestamp":1785179459000},"page":"2137-2142","source":"Crossref","is-referenced-by-count":1,"title":["From Global to Local: Hierarchical Probabilistic Verification for Reachability Learning"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6848-0117","authenticated-orcid":false,"given":"Ebonye","family":"Smith","sequence":"first","affiliation":[{"name":"University of California, Berkeley","place":["Berkeley, CA, USA"],"department":["Department of Electrical Engineering and Computer Sciences"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3385-8305","authenticated-orcid":false,"given":"Sampada","family":"Deglurkar","sequence":"additional","affiliation":[{"name":"University of California, Berkeley","place":["Berkeley, CA, USA"],"department":["Department of Electrical Engineering and Computer Sciences"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3731-3807","authenticated-orcid":false,"given":"Jingqi","family":"Li","sequence":"additional","affiliation":[{"name":"The University of Texas at Austin","place":["Austin, TX, USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gechen","family":"Qu","sequence":"additional","affiliation":[{"name":"University of California, Berkeley","place":["Berkeley, CA, USA"],"department":["Department of Electrical Engineering and Computer Sciences"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3192-3185","authenticated-orcid":false,"given":"Claire J.","family":"Tomlin","sequence":"additional","affiliation":[{"name":"University of California, Berkeley","place":["Berkeley, CA, USA"],"department":["Department of Electrical Engineering and Computer Sciences"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2023.3291885"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/9.664154"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2004.01.012"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.851439"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263977"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561949"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8794107"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2021.XVII.077"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2025.3535183"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160872"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304391"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304296"},{"key":"ref13","first-page":"2055","article-title":"Sampling-based reachability analysis: A random set theory approach with adversarial sampling","volume-title":"Proc. Conf. Robot Learn.","author":"Lew"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3170863"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.014"},{"key":"ref16","first-page":"75","article-title":"Estimating reachable sets with scenario optimization","author":"Devonport","year":"2020","journal-title":"Proc. 2nd Annu. Learn. Dyn. Control Conf."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9682962"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9682860"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10160600"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3292071"},{"key":"ref21","first-page":"719","article-title":"Verification of neural reachable tubes via scenario optimization and conformal prediction","volume-title":"Proc. 6th Annu. Learn. Dyn. Control Conf.","author":"Lin"},{"key":"ref22","first-page":"1432","article-title":"Robust verification of controllers under state uncertainty via hamilton-jacobi reachability analysis","author":"Lin","year":"2026","journal-title":"Proc. 8th Annu. Learn. Dyn. Control Conf."},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CDC57313.2025.11312065"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975444"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2105730"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2009.07.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487277"},{"key":"ref28","article-title":"Solving reach-avoid-stay problems using deep deterministic policy gradients","volume-title":"arXiv:2410.02898","author":"Chenevert"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2026.3717040"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/7782633\/11370312\/11625759-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7782633\/11370312\/11625759.pdf?arnumber=11625759","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T04:54:27Z","timestamp":1786078467000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11625759\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2026.3717040","relation":{},"ISSN":["2475-1456"],"issn-type":[{"value":"2475-1456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}