{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:10Z","timestamp":1761610390158,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":5323,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80601-2","type":"journal-article","created":{"date-parts":[[2005,5,6]],"date-time":"2005-05-06T15:34:43Z","timestamp":1115393683000},"page":"156-170","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Probabilistic Symbolic Simulation and Verification with \u2295-OBDDs"],"prefix":"10.1016","volume":"22","author":[{"given":"Christoph","family":"Meinel","sequence":"first","affiliation":[]},{"given":"Harald","family":"Sack","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1571-0661(05)80601-2_BIB1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0020-0190(80)90078-2","article-title":"Equivalence of Free Boolean Graphs Can be Decided Probabilistically in Polynomial Time","volume":"10","author":"Blum","year":"1980","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(05)80601-2_BIB2","series-title":"PhD thesis","article-title":"Ordered Binary Decision Diagrams for Optimization in Symbolic Switch-Level Analysis of MOS Circuits","author":"Brace","year":"1992"},{"key":"10.1016\/S1571-0661(05)80601-2_BIB3","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1145\/123186.123222","article-title":"Efficient Implementation of a BDD Package","author":"Brace","year":"1990","journal-title":"27th ACM\/IEEE Design Automation Conference"},{"issue":"2","key":"10.1016\/S1571-0661(05)80601-2_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1109\/12.73590","article-title":"On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication","volume":"40","author":"Bryant","year":"1991","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/S1571-0661(05)80601-2_BIB5","series-title":"Proc. of the 10th annual Symposium on Theoretical Aspects of Computer Science, volume 665 of LNCS","first-page":"576","article-title":"Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs","author":"Gergov","year":"1993"},{"key":"10.1016\/S1571-0661(05)80601-2_BIB6","first-page":"273","article-title":"Mod2-OBDDs: A Data Structure that Generalizes EXOR-Sum-of-Products and Ordered Binary Decision Diagrams","volume":"volume 8","author":"Gergov","year":"1996"},{"key":"10.1016\/S1571-0661(05)80601-2_BIB7","series-title":"In Proc. of the 8th Int. Conference on Computer Aided Verification, number 1102 in Lecture Notes in Computer Science","first-page":"428","article-title":"VIS: A system for Verification and Synthesis","author":"The VIS Group","year":"1996"},{"key":"10.1016\/S1571-0661(05)80601-2_BIB8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00464357","article-title":"Probabilistic Verification of Boolean Functions","volume":"volume 1","author":"Jain","year":"1992","journal-title":"Formal Methods in System Design"},{"key":"10.1016\/S1571-0661(05)80601-2_BIB9","first-page":"308","article-title":"Proving Circuit Correctness Using Formal Comparison Between Expected and Extracted Behaviour","author":"Madre","year":"1988","journal-title":"Proc. of the 25th ACM\/IEEE Design Automation Conference"},{"year":"1989","series-title":"Modified Branching Programs and Their Computational Power volume 370 of LNCS.","author":"Meinel","key":"10.1016\/S1571-0661(05)80601-2_BIB10"},{"year":"1998","series-title":"Algorithms and Data Structures in VLSI Design","author":"Meinel","key":"10.1016\/S1571-0661(05)80601-2_BIB11"},{"key":"10.1016\/S1571-0661(05)80601-2_BIB12","series-title":"In Proc. of the 14th Symposium on Theoretical Aspects of Computer Science, volume 1200 of LNCS.","article-title":"On the Descriptive and Algorithmic Power of Parity Ordered Binary Decision Diagrams","author":"Waack","year":"1997"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806012?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105806012?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:35Z","timestamp":1761610115000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105806012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":12,"alternative-id":["S1571066105806012"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80601-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Probabilistic Symbolic Simulation and Verification with \u2295-OBDDs","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80601-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}