{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:46:25Z","timestamp":1743018385129,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156427"},{"type":"electronic","value":"9783642156434"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15643-4_13","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T09:39:39Z","timestamp":1284975579000},"page":"158-172","source":"Crossref","is-referenced-by-count":2,"title":["Lattice-Valued Binary Decision Diagrams"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Geeraerts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Kalyon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tristan","family":"Le Gall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Maquet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Francois","family":"Raskin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"DAC 1993","author":"S. Minato","year":"1993","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: DAC 1993. ACM, New York (1993)"},{"key":"13_CR2","volume-title":"LICS","author":"H. Reif Andersen","year":"1997","unstructured":"Reif Andersen, H., Hulgaard, H.: Boolean Expression Diagrams. In: LICS. IEEE, Los Alamitos (1997)"},{"key":"13_CR3","unstructured":"Devereux, B., Chechik, M.: Edge-Shifted Decision Diagrams for Multiple-Valued Logic. In: JMVLSC. Old City Publishing (2003)"},{"key":"13_CR4","volume-title":"POPL 1977","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: POPL 1977. ACM, New York (1977)"},{"key":"13_CR5","volume-title":"Model Checking","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"13_CR6","volume-title":"LICS 1990","author":"J.R. Burch","year":"1990","unstructured":"Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, J.: Symbolic Model Checking: 1020 States and Beyond. In: LICS 1990. IEEE, Los Alamitos (1990)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-44685-0_30","volume-title":"CONCUR 2001 - Concurrency Theory","author":"M. Chechik","year":"2001","unstructured":"Chechik, M., Devereux, B., Easterbrook, S., Lai, A., Petrovykh, V.: Efficient Multiple-Valued Model-Checking Using Lattice Representations. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, p. 441. Springer, Heidelberg (2001)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-48683-6_44","volume-title":"Computer Aided Verification","author":"A. Cimatti","year":"1999","unstructured":"Cimatti, A., Clarke, E.M., Giunchiglia, F., Roveri, M.: NuSMV: A new symbolic model verifier. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 495\u2013499. Springer, Heidelberg (1999)"},{"key":"13_CR9","volume-title":"STTT","author":"G. Delzanno","year":"2003","unstructured":"Delzanno, G., Raskin, J.-.F., Van Begin, L.: Covering sharing trees: a compact data structure for parameterized verification. In: STTT, vol.\u00a05(2-3). Springer, Heidelberg (2003)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Bryant, R.: Graph-based Algorithms for Boolean Function Manipulation. IEEE Trans. on Comp.\u00a0C-35(8) (1986)","DOI":"10.1109\/TC.1986.1676819"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-540-69738-1_14","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"O. Kupferman","year":"2007","unstructured":"Kupferman, O., Lustig, Y.: Lattice Automata. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol.\u00a04349, pp. 199\u2013213. Springer, Heidelberg (2007)"},{"key":"13_CR12","unstructured":"Fujita, M., McGeer, P.C., Yang, J.C.Y.: Multi-terminal binary decision diagrams: An efficient data structure for matrix representation. Form. Methods Syst. Des.\u00a010(2-3) (1997)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11817963_5","volume-title":"Computer Aided Verification","author":"M. Wulf De","year":"2006","unstructured":"De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.F.: Antichains: A new algorithm for checking universality of finite automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 17\u201330. Springer, Heidelberg (2006)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-3-642-12002-2_2","volume-title":"TACAS 2010","author":"L. Doyen","year":"2010","unstructured":"Doyen, L., Raskin, J.F.: Antichain Algorithms for Finite Automata. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 2\u201322. Springer, Heidelberg (2010)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-540-73370-6_11","volume-title":"Model Checking Software","author":"K. Rozier","year":"2007","unstructured":"Rozier, K., Vardi, M.: LTL Satisfiability Checking. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol.\u00a04595, pp. 149\u2013167. Springer, Heidelberg (2007)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/11691617_4","volume-title":"Model Checking Software","author":"J. Geldenhuys","year":"2006","unstructured":"Geldenhuys, J., Hansen, H.: Larger automata and less work for LTL model checking. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol.\u00a03925, pp. 53\u201370. Springer, Heidelberg (2006)"},{"key":"13_CR17","volume-title":"Lattice Theory. Colloquim Publications","author":"G. Birkhoff","year":"1999","unstructured":"Birkhoff, G.: Lattice Theory. Colloquim Publications. Am. Math. Soc., Providence (1999)"},{"key":"13_CR18","unstructured":"Lind-Nielsen, J.: Buddy: BDD package, \n                    \n                      http:\/\/www.itu.dk\/research\/buddy"},{"key":"13_CR19","unstructured":"NuSMV Model-checker, \n                    \n                      http:\/\/nusmv.irst.itc.it\/"},{"key":"13_CR20","unstructured":"SMV Model-checker, \n                    \n                      http:\/\/www.cs.cmu.edu\/~modelcheck\/smv.html"},{"key":"13_CR21","unstructured":"Somenzi, F.: BDD package CUDD, \n                    \n                      http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-642-02979-0_19","volume-title":"CIAA 2009","author":"P. Ganty","year":"2009","unstructured":"Ganty, P., Maquet, N., Raskin, J.F.: Fixpoint Guided Abstraction Refinements for Alternating Automata. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 155\u2013164. Springer, Heidelberg (2009)"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-78800-3_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Wulf De","year":"2008","unstructured":"De Wulf, M., Doyen, L., Maquet, N., Raskin, J.F.: Antichains: Alternative Algorithms for LTL Satisfiability. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 63\u201377. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15643-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T18:57:21Z","timestamp":1558292241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15643-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156427","9783642156434"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15643-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}