{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:39:07Z","timestamp":1760121547203,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662020"},{"type":"electronic","value":"9783540486831"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48683-6_24","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T03:22:18Z","timestamp":1191727338000},"page":"261-273","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On the Representation of Probabilities over Structured Domains"],"prefix":"10.1007","author":[{"given":"Marius","family":"Bozga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Maler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,1,14]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C-35","author":"R.E. Bryant","year":"1986","unstructured":"R.E. Bryant, Graph-based Algorithms for Boolean Function Manipulation, IEEE Trans. on Computers C-35, 677\u2013691, 1986.","journal-title":"IEEE Trans. on Computers"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"[. J.R. Burch","year":"1992","unstructured":"[BCM+93]_ J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang, Symbolic Model-Checking: 1020 States and Beyond, Information and Computation 98, 142\u201370, 1992.","journal-title":"Information and Computation"},{"unstructured":"C. Boutilier, T. Dean and S. Hanks, Decision Theoretic Planning: Structural Assumptions and Computational Leverage, J. of AI Research (to appear).","key":"24_CR3"},{"doi-asserted-by":"crossref","unstructured":"[BFG+93]_ R.I. Bahar, E.A. Frohm, C.M. Ganoa, G.D. Hachtel, E. Macii, A. Pardo and F. Somenzi, Algebraic Decision Diagrams and their Applications, Proc. ICCAD\u201993, 188\u2013191, 1993.","key":"24_CR4","DOI":"10.1109\/ICCAD.1993.580054"},{"key":"24_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/3-540-63165-8_199","volume-title":"Proc. ICALP\u201997","author":"[. C. Baier","year":"1997","unstructured":"[BCG+97]_ C. Baier, E. Clarke, V. Garmhausen-Hartonas, M. Kwiatkowska and M. Ryan, Symbolic Model Checking for Probabilistic Processes, in P. Degano, R. Gorrieri and A. Marchetti-Spaccamela (Eds.), Proc. ICALP\u201997, 430\u2013440, LNCS 1256, Springer, 1997."},{"unstructured":"[CFM+93]_ E. M. Clarke, M. Fujita, P. C. McGeer, K. L. Mcmillan and J. C.-Y. Yang, Multi-terminal Binary decision Diagrams: An Efficient Data-structure for Matrix Representation, Proc. ILWS\u201993, 1\u201315, 1993.","key":"24_CR6"},{"unstructured":"F.V. Jensen, An Introduction to Bayesian Networks, Springer, 1996.","key":"24_CR7"},{"doi-asserted-by":"crossref","unstructured":"K.L. McMillan, Symbolic Model-Checking: an Approach to the State-Explosion problem, Kluwer, 1993.","key":"24_CR8","DOI":"10.1007\/978-1-4615-3190-6"},{"doi-asserted-by":"crossref","unstructured":"C. Meinel and T. Theobald, Algorithms and Data Structures in VLSI Design: OBDD-Foundations and Applications, Springer, 1998.","key":"24_CR9","DOI":"10.1007\/978-3-642-58940-9"},{"unstructured":"J. Pearl, Probabilistic Reasoning in Intelligent Systems, Morgan Kaufmann, 1988.","key":"24_CR10"},{"doi-asserted-by":"crossref","unstructured":"M.L. Puterman, Markov Decision Processes, Wiley, 1994.","key":"24_CR11","DOI":"10.1002\/9780470316887"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/A:1008691605584","volume":"10","author":"P. Tafertshofer","year":"1997","unstructured":"P. Tafertshofer and M. Pedram, Factored Edge-Valued Binary Decision Diagrams, Formal Methods in system Design 10, 137\u2013164, 1997.","journal-title":"Formal Methods in system Design"},{"doi-asserted-by":"crossref","unstructured":"S. B. K. Vrudhula, M. Pedram and Y.-T. Lai, Edge-valued Binary Decision Diagrams, in T. Sasao and M. Fujita (Eds.), Representations of Discrete Functions, 109\u2013132, Kluwer, 1996.","key":"24_CR13","DOI":"10.1007\/978-1-4613-1385-4_5"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48683-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:37:09Z","timestamp":1737463029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48683-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662020","9783540486831"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48683-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"14 January 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}