{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:01:48Z","timestamp":1771696908510,"version":"3.50.1"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"ARO","award":["W911NF-15-1-0592"],"award-info":[{"award-number":["W911NF-15-1-0592"]}]},{"name":"ARO","award":["NSF 1652113"],"award-info":[{"award-number":["NSF 1652113"]}]},{"name":"ARO","award":["NSF 1646522"],"award-info":[{"award-number":["NSF 1646522"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/tac.2021.3115080","type":"journal-article","created":{"date-parts":[[2021,9,27]],"date-time":"2021-09-27T20:32:55Z","timestamp":1632774775000},"page":"5055-5070","source":"Crossref","is-referenced-by-count":3,"title":["Probably Approximately Correct Learning in Adversarial Environments With Temporal Logic Specifications"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1496-8816","authenticated-orcid":false,"given":"Min","family":"Wen","sequence":"first","affiliation":[{"name":"Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0819-9985","authenticated-orcid":false,"given":"Ufuk","family":"Topcu","sequence":"additional","affiliation":[{"name":"Department of Aerospace Engineering and Engineering Mechanics, University of Texas at Austin, Austin, TX, USA"}]}],"member":"263","reference":[{"key":"ref39","article-title":"tcsprojects\/pgsolver","author":"friedmann","year":"2015"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref33","author":"baier","year":"2008","journal-title":"Principles of Model Checking"},{"key":"ref32","first-page":"3630","article-title":"Probably approximately correct learning in stochastic games with temporal logic specifications","author":"wen","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2015.7354078"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.23919\/FMCAD.2019.8894254"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24727-2_35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.05.002"},{"key":"ref35","first-page":"213","article-title":"R-max-A general polynomial time algorithm for near-optimal reinforcement learning","volume":"3","author":"brafman","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-0417(01)00015-8"},{"key":"ref10","article-title":"The PGsolver collection of parity game solvers","author":"friedmann","year":"2009"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45220-1_11"},{"key":"ref12","author":"chatterjee","year":"2005","journal-title":"The Complexity of Stochastic Rabin and Streett Games"},{"key":"ref13","first-page":"2413","article-title":"Reinforcement learning in finite MDPs: PAC analysis","volume":"10","author":"strehl","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.039"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.26"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_50"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32940-1_10"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54830-7_14"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934513"},{"key":"ref28","first-page":"8:1","article-title":"Learning-based mean-payoff optimization in an unknown MDP under omega-regular constraints","author":"kret\u00ednsk?","year":"0","journal-title":"Proc 29th Int Conf Concurrency Theory"},{"key":"ref4","first-page":"5025","article-title":"Revising motion planning under linear temporal logic specifications in partially known workspaces","author":"guo","year":"0","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11797"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911417911"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33386-6_7"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8618922"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631296"},{"key":"ref8","article-title":"Ltl2dstar - LTL to deterministic Streett and Rabin automata","author":"klein","year":"2015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_62"},{"key":"ref2","first-page":"3116","article-title":"Where’s Waldo? Sensor-based temporal logic motion planning","author":"kress-gazit","year":"0","journal-title":"Proc IEEE Int Conf Robot Autom"},{"key":"ref9","article-title":"Ltl3dra - LTL to deterministic Rabin automata translator based on LTL3BA","author":"blahoudek","year":"2015"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4054-9"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40196-1_28"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196796"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11936-6_8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17462-0_27"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3302509.3311053"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9028919"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/9\/9903918\/9548833-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9903918\/09548833.pdf?arnumber=9548833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T01:10:34Z","timestamp":1667524234000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9548833\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":39,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tac.2021.3115080","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}