{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:02:58Z","timestamp":1768338178469,"version":"3.49.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["D19AP00004"],"award-info":[{"award-number":["D19AP00004"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006602","name":"Air Force Research Laboratory","doi-asserted-by":"publisher","award":["FA9550-19-1-0169"],"award-info":[{"award-number":["FA9550-19-1-0169"]}],"id":[{"id":"10.13039\/100006602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1109\/tac.2019.2922583","type":"journal-article","created":{"date-parts":[[2019,6,12]],"date-time":"2019-06-12T19:46:45Z","timestamp":1560368805000},"page":"1552-1567","source":"Crossref","is-referenced-by-count":26,"title":["Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2976-0786","authenticated-orcid":false,"given":"Yagiz","family":"Savas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8510-8787","authenticated-orcid":false,"given":"Melkior","family":"Ornik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0409-2403","authenticated-orcid":false,"given":"Murat","family":"Cubuktepe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6812-956X","authenticated-orcid":false,"given":"Mustafa O.","family":"Karabag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0819-9985","authenticated-orcid":false,"given":"Ufuk","family":"Topcu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum-redundancy codes","volume":"40","author":"huffman","year":"0","journal-title":"Proc IRE"},{"key":"ref32","article-title":"ltl2dstar- LTL to deterministic Streett and Rabin automata","author":"klein","year":"2007"},{"key":"ref31","first-page":"1","article-title":"CVXPY: A Python-embedded modeling language for convex optimization","volume":"17","author":"diamond","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0892-3"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89332-5"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1287\/moor.16.3.580"},{"key":"ref10","first-page":"6662","article-title":"Verification of elgamal algorithm cryptographic protocol using linear temporal logic","author":"kumar","year":"0","journal-title":"Proc Int Conf Multimedia Technol"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.243461"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1160633.1160681"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10799-008-0047-9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2009.11-07-643"},{"key":"ref15","first-page":"1352","article-title":"Reinforcement learning with deep energy-based policies","volume":"70","author":"haarnoja","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0191-2615(96)00003-3"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636066"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.07.034"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2844120"},{"key":"ref28","article-title":"Algorithms for unsymmetric cone optimization and implementation for problems with the exponential cone","author":"serrano","year":"2015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2849556"},{"key":"ref27","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","author":"puterman","year":"1994","journal-title":"Markov Decision Processes Discrete Stochastic Dynamic Programming"},{"key":"ref3","first-page":"571","article-title":"On the complexity of computing maximum entropy for Markovian models","author":"chen","year":"0","journal-title":"Proc Conf Foundations of Software Technology & Theoretical Computer Science"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022460"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2014.X.039"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363946"},{"key":"ref7","first-page":"493","article-title":"Specification-based testing with linear temporal logic","author":"tan","year":"0","journal-title":"Proc IEEE Int Conf Inf Reuse Integr"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlamp.2014.05.001"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298143"},{"key":"ref1","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2906473"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71209-1_6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2262497"},{"key":"ref24","article-title":"Markovian processes for quantitative information leakage","author":"biondi","year":"2014"},{"key":"ref23","author":"baier","year":"2008","journal-title":"Principles of Model Checking"},{"key":"ref26","author":"bertsekas","year":"1996","journal-title":"Neuro-Dynamic Programming"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2013\/04\/P04010"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9049232\/08735817.pdf?arnumber=8735817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T15:37:23Z","timestamp":1663688243000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8735817\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":37,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tac.2019.2922583","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":[[2020,4]]}}}