{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:23:25Z","timestamp":1648902205895},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2016,10,1]],"date-time":"2016-10-01T00:00:00Z","timestamp":1475280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2016,10,1]]},"DOI":"10.1109\/tc.2015.2512872","type":"journal-article","created":{"date-parts":[[2015,12,28]],"date-time":"2015-12-28T19:02:29Z","timestamp":1451329349000},"page":"3148-3156","source":"Crossref","is-referenced-by-count":0,"title":["The Size of BDDs and Other Data Structures in Temporal Logics Model Checking"],"prefix":"10.1109","volume":"65","author":[{"given":"Andrea","family":"Ferrara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Liberatore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","article-title":"On the size of data structures used in symbolic model checking","volume":"abs 1012 3018","author":"ferrara","year":"2010","journal-title":"CoRR"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1613\/jair.1113","article-title":"Propositional independence—Formula-variable independence and forgetting","volume":"18","author":"lang","year":"2003","journal-title":"J Artif Intell Res"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/504794.504795"},{"key":"ref30","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1137\/0213018","article-title":"N by N checkers is exptime complete","volume":"13","author":"m","year":"1984","journal-title":"SIAM J Comput"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/11591191_34"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45841-7_51"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/s100090100056","article-title":"Binary decision diagrams in theory and practice","volume":"3","author":"drechsler","year":"2001","journal-title":"Int J Softw Tools Technol Transfer"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/12.73590"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","article-title":"Symbolic model checking: $10^{20}$ states and beyond","volume":"98","author":"r","year":"1992","journal-title":"Inf Comput"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1613\/jair.4586","article-title":"BDD ordering heuristics for classical planning","volume":"51","author":"kissmann","year":"2014","journal-title":"J Artif Intell Res"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18008-3_15"},{"key":"ref14","article-title":"BDDs strike back (in AI planning)","author":"edelkamp","year":"0","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00181-H"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/s100090100037","article-title":"Verification of arithmetic circuits using binary moment diagrams","volume":"3","author":"e","year":"2001","journal-title":"Int J Softw Tools Technol Transfer"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46419-0_28"},{"key":"ref18","first-page":"1","article-title":"Multi terminal binary decision diagrams: An efficient data structure for matrix representation","author":"clarke","year":"0","journal-title":"Proc Int Workshop Logic Synthesis"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1993.580054"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3043"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3190-6"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1137\/S0097539700389652","article-title":"Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses","volume":"31","author":"r","year":"2002","journal-title":"SIAM J Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/32.588521"},{"key":"ref6","first-page":"585","article-title":"PRISM 4.0: Verification of probabilistic real-time systems","author":"kwiatkowska","year":"0","journal-title":"Proc 23rd Int Conf Comput Aided Verification"},{"key":"ref29","first-page":"1","article-title":"Machine models and simulations","author":"boas","year":"2014","journal-title":"Handbook of Theoretical Computer Science"},{"key":"ref5","first-page":"359","article-title":"NuSMV 2: An open-source tool for symbolic model checking","author":"cimatti","year":"0","journal-title":"Proc 14th Int Conf Comput -Aided Verification"},{"key":"ref8","first-page":"393","article-title":"The complexity of temporal logic model checking","volume":"4","author":"schnoebelen","year":"2002","journal-title":"Advances in Modal Logic 5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58179-0_53"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74782-6_6"},{"key":"ref1","author":"clarke","year":"2000","journal-title":"Model checking"},{"key":"ref20","first-page":"819","article-title":"SDD: A new canonical representation of propositional knowledge bases","volume":"22","author":"darwiche","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(71)90010-5"},{"key":"ref24","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)90081-7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90061-X"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88071-0.50007-2"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/7560676\/07366751.pdf?arnumber=7366751","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:45:46Z","timestamp":1642005946000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7366751\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,1]]},"references-count":37,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tc.2015.2512872","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2016,10,1]]}}}