{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T05:58:31Z","timestamp":1783490311409,"version":"3.55.0"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100011102","name":"Seventh Framework Programme","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100011102","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470739","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-13","source":"Crossref","is-referenced-by-count":2,"title":["Symbolic Time and Space Tradeoffs for Probabilistic Verification"],"prefix":"10.1109","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wolfgang","family":"Dvorak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Svozil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(82)90136-3"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45315-6_18"},{"key":"ref32","author":"howard","year":"1960","journal-title":"Dynamic Programming and Markov Processes"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9079-5"},{"key":"ref30","first-page":"573","article-title":"Computing strongly connected components in a linear number of symbolic steps","author":"gentilini","year":"2003","journal-title":"SODA"},{"key":"ref37","first-page":"303","article-title":"Binary Decision Diagrams","author":"somenzi","year":"1999","journal-title":"Calculational System Design"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref35","first-page":"585","article-title":"PRISM 4.0: Verification of probabilistic real-time systems","author":"kwiatkowska","year":"2011","journal-title":"CAV"},{"key":"ref34","first-page":"8:1","article-title":"Learning-based mean-payoff optimization in an unknown MDP under omega-regular constraints","author":"kret\u00ednsk\u00fd","year":"2018","journal-title":"CONCUR"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2935304"},{"key":"ref11","first-page":"18:1","article-title":"Improved set-based symbolic algorithms for parity games","author":"chatterjee","year":"2017","journal-title":"CSL"},{"key":"ref12","first-page":"7:1","article-title":"Near-linear time algorithms for streett objectives in graphs and MDPs","author":"chatterjee","year":"2019","journal-title":"CONCUR"},{"key":"ref13","first-page":"1318","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":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2597631"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-012-0180-2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96142-2_13"},{"key":"ref17","first-page":"32","article-title":"Probabilistic systems with limsup and liminf objectives","author":"chatterjee","year":"2007","journal-title":"ILC"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2699430"},{"key":"ref19","first-page":"315","article-title":"Decremental single-source reachability and strongly connected components in $\\widetilde O\\left( {m\\sqrt n } \\right)$ total update time","author":"chechik","year":"2016","journal-title":"FOCS"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322234.322235","article-title":"An On-Line Edge-Deletion Problem","volume":"28","author":"even","year":"1981","journal-title":"J ACM"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00228-9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_31"},{"key":"ref3","first-page":"33","article-title":"Two views on multiple mean-payoff objectives in Markov decision processes","author":"br\u00e1zdil","year":"2011","journal-title":"LICS 2011"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/136035.136043"},{"key":"ref29","author":"filar","year":"1997","journal-title":"Competitive Markov Decision Processes"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref8","author":"chatterjee","year":"2007","journal-title":"Stochastic ?-Regular Games"},{"key":"ref7","first-page":"428","article-title":"Symbolic model checking: 10^20 states and beyond","author":"burch","year":"1990","journal-title":"LICS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316335"},{"key":"ref9","first-page":"2341","article-title":"Lower bounds for symbolic computation on graphs: strongly connected components, liveness, safety, and diameter","author":"chatterjee","year":"2018","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref1","author":"baier","year":"2008","journal-title":"Principles of Model Checking"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/876638.876643"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61474-5_93"},{"key":"ref21","article-title":"Symbolic model checking","author":"clarke","year":"1999","journal-title":"Model checking"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210339"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0032043"},{"key":"ref26","article-title":"Formal Verification of Probabilistic Systems","author":"de alfaro","year":"1997","journal-title":"PhD thesis"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3060139"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Rome, Italy","start":{"date-parts":[[2021,6,29]]},"end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470739.pdf?arnumber=9470739","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:20Z","timestamp":1652197580000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470739\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470739","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}