{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:31:38Z","timestamp":1730280698883,"version":"3.28.0"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"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":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785672","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-14","source":"Crossref","is-referenced-by-count":0,"title":["Long-run Satisfaction of Path Properties"],"prefix":"10.1109","author":[{"given":"Christel","family":"Baier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathalie","family":"Bertrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jakob","family":"Piribauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ocan","family":"Sankur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.50.2"},{"key":"ref32","first-page":"10:1","article-title":"Robust linear temporal logic","volume":"62","author":"tabuada","year":"2016","journal-title":"25th EACSL Annual Conference on Computer Science Logic (CSL)"},{"journal-title":"Markov Decision Processes Discrete Stochastic Dynamic Programming","year":"1994","author":"puterman","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90045-5"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.tcs.2011.08.002","article-title":"Simulation distances","volume":"413","author":"cern\u00fd","year":"2012","journal-title":"Theoretical Computer Science"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22993-0_21"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1318","DOI":"10.1137\/1.9781611973082.101","article-title":"Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification","author":"chatterjee","year":"2011","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-006-0001-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-008-0060-y"},{"journal-title":"Model checking","year":"2000","author":"clarke","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210339"},{"journal-title":"Formal Verification of Probabilistic Systems","year":"1997","author":"de alfaro","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1998.705679"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48320-9_7"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48320-9_27"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/moor.16.3.580"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2008.ECP.29"},{"journal-title":"Principles of Model Checking","year":"2008","author":"baier","key":"ref3"},{"key":"ref6","first-page":"43","article-title":"Temporal specifications with accumulative values","author":"udi","year":"2011","journal-title":"Proc of the 26th Annual IEEE Symposium on Logic in Computer Science (LICS)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s100090100062"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30642-6_4"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_19"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2012.43"},{"key":"ref2","article-title":"Long-run satisfaction of path properties","author":"baier","year":"2019","journal-title":"Technical Report"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3209108.3209184"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.2168\/LMCS-10(1:13)2014","article-title":"Two views on multiple mean-payoff objectives in markov decision processes","volume":"10","author":"br\u00e1zdil","year":"2014","journal-title":"Logical Methods in Computer Science"},{"key":"ref20","first-page":"184","article-title":"On frequency LTL in probabilistic systems","volume":"42","author":"forejt","year":"2015","journal-title":"26th Int Conf Concurrency Theory (CONCUR'15)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.03.016"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48899-7_12"},{"key":"ref24","article-title":"Linear programming and finite Markovian control problems","volume":"148","author":"kallenberg","year":"1983","journal-title":"Math Center Tracts"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_20"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.16"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(78)90011-0"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785672.pdf?arnumber=8785672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:18:53Z","timestamp":1658261933000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785672\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785672","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}