{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T00:57:49Z","timestamp":1775264269223,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/tac.2018.2879505","type":"journal-article","created":{"date-parts":[[2018,11,5]],"date-time":"2018-11-05T20:36:21Z","timestamp":1541450181000},"page":"3332-3338","source":"Crossref","is-referenced-by-count":11,"title":["Permissive Supervisor Synthesis for Markov Decision Processes Through Learning"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7199-6525","authenticated-orcid":false,"given":"Bo","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4545-9814","authenticated-orcid":false,"given":"Xiaobin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5242-2366","authenticated-orcid":false,"given":"Hai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/964001.964021"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_16"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_25"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/10722167_15","article-title":"Counterexample-guided abstraction refinement","author":"clarke","year":"2000","journal-title":"Proc Int Conf Comput Aided Verification"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.94"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7040356"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2728606.2728628"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2015.7171174"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2016.7526535"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33386-6_27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028765"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619683"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2530623"},{"key":"ref3","article-title":"A learning based optimal human robot collaboration with linear temporal logic constraints","author":"wu","year":"2017"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21455-4_3"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1838552.1838553"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2849554"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-11(2:16)2015"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68612-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2007.907072"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2013.2290971"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_32"},{"key":"ref22","author":"puterman","year":"2014","journal-title":"Markov Decision Processes Discrete Stochastic Dynamic Programming"},{"key":"ref21","author":"baier","year":"2008","journal-title":"Principles of Model Checking"},{"key":"ref24","first-page":"65","article-title":"Counterexample generation for discrete-time Markov models: An introductory survey","author":"\u00e1brah\u00e1m","year":"2014","journal-title":"Formal Methods for Executable Software Models"},{"key":"ref23","first-page":"250","article-title":"Probabilistic simulations for probabilistic processes","volume":"2","author":"segala","year":"1995","journal-title":"Nordic J Comput"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1090\/crmm\/023"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28756-5_21"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/9\/8777205\/8521689-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/8777205\/08521689.pdf?arnumber=8521689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T23:50:22Z","timestamp":1775260222000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8521689\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":30,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tac.2018.2879505","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":[[2019,8]]}}}