{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:14:52Z","timestamp":1761488092152},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540687450"},{"type":"electronic","value":"9783540687467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68746-7_16","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:37:54Z","timestamp":1217471874000},"page":"211-230","source":"Crossref","is-referenced-by-count":13,"title":["Hierarchical Set Decision Diagrams and Automatic Saturation"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Hamez","sequence":"first","affiliation":[]},{"given":"Yann","family":"Thierry-Mieg","sequence":"additional","affiliation":[]},{"given":"Fabrice","family":"Kordon","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"16_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0890-5401(92)90017-A","volume":"98","author":"J. Burch","year":"1992","unstructured":"Burch, J., Clarke, E., McMillan, K.: Symbolic model checking: 1020 states and beyond (Special issue for best papers from LICS90). Information and Computation\u00a098(2), 153\u2013181 (1992)","journal-title":"Information and Computation"},{"issue":"9","key":"16_CR3","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1109\/12.537122","volume":"45","author":"B. Bollig","year":"1996","unstructured":"Bollig, B., Wegener, I.: Improving the Variable Ordering of OBDDs Is NP-Complete. IEEE Trans. Comput.\u00a045(9), 993\u20131002 (1996)","journal-title":"IEEE Trans. Comput."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-60029-9_50","volume-title":"Application and Theory of Petri Nets 1995","author":"O. Roig","year":"1995","unstructured":"Roig, O., Cortadella, J., Pastor, E.: Verification of asynchronous circuits by BDD-based model checking of Petri nets. In: DeMichelis, G., D\u00edaz, M. (eds.) ICATPN 1995. LNCS, vol.\u00a0935, pp. 374\u2013391. Springer, Heidelberg (1995)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-36577-X_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Ciardo","year":"2003","unstructured":"Ciardo, G., Marmorstein, R., Siminiceanu, R.: Saturation unbound. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 379\u2013393. Springer, Heidelberg (2003)"},{"key":"16_CR6","first-page":"597","volume-title":"ICSE 1999: Proceedings of the 21st international conference on Software engineering","author":"G. Holzmann","year":"1999","unstructured":"Holzmann, G., Smith, M.: A practical method for verifying event-driven software. In: ICSE 1999: Proceedings of the 21st international conference on Software engineering, Los Alamitos, CA, USA, pp. 597\u2013607. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"16_CR7","unstructured":"LIP6\/Move: the libDDD environment (2007), http:\/\/www.lip6.fr\/libddd"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Application and Theory of Petri Nets 2002","author":"J.M. Couvreur","year":"2002","unstructured":"Couvreur, J.M., Encrenaz, E., Paviot-Adet, E., Poitrenaud, D., Wacrenier, P.A.: Data Decision Diagrams for Petri Net Analysis. In: Esparza, J., Lakos, C.A. (eds.) ICATPN 2002. LNCS, vol.\u00a02360, pp. 1\u2013101. Springer, Heidelberg (2002)"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/11562436_32","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"J.M. Couvreur","year":"2005","unstructured":"Couvreur, J.M., Thierry-Mieg, Y.: Hierarchical Decision Diagrams to Exploit Model Structure. In: Wang, F. (ed.) FORTE 2005. LNCS, vol.\u00a03731, pp. 443\u2013457. Springer, Heidelberg (2005)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Wang, F.: Formal verification of timed systems: A survey and perspective. IEEE\u00a092(8) (2004)","DOI":"10.1109\/JPROC.2004.831197"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-36126-X_16","volume-title":"Formal Methods in Computer-Aided Design","author":"G. Ciardo","year":"2002","unstructured":"Ciardo, G., Siminiceanu, R.: Using edge-valued decision diagrams for symbolic generation of shortest paths. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol.\u00a02517, pp. 256\u2013273. Springer, Heidelberg (2002)"},{"key":"16_CR12","unstructured":"Somenzi, F.: CUDD: CU Decision Diagram Package (release 2.4.1) (2005), http:\/\/vlsi.colorado.edu\/fabio\/CUDD\/cuddIntro.html"},{"key":"16_CR13","unstructured":"Lind-Nielsen, J., Mishchenko, A., Behrmann, G., Hulgaard, H., Andersen, H.R., Lichtenberg, J., Larsen, K., Soranzo, N., Bjorner, N., Duret-Lutz, A., Cohen, H.a.: buddy - library for binary decision diagrams (release 2.4) (2004), http:\/\/buddy.wiki.sourceforge.net\/"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Ciardo, G.: Reachability Set Generation for Petri Nets: Can Brute Force Be Smart? Applications and Theory of Petri Nets 2004, pp. 17\u201334 (2004)","DOI":"10.1007\/978-3-540-27793-4_2"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/11494744_10","volume-title":"Applications and Theory of Petri Nets 2005","author":"L. Cabac","year":"2005","unstructured":"Cabac, L., Duvigneau, M., Moldt, D., R\u00f6lke, H.: Modeling Dynamic Architectures Using Nets-within-Nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol.\u00a03536, pp. 148\u2013167. Springer, Heidelberg (2005)"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Biberstein, O., Buchs, D., Guelfi, N.: Object-oriented nets with algebraic specifications: The CO-OPN\/2 formalism (2001)","DOI":"10.1007\/3-540-45397-0_3"}],"container-title":["Lecture Notes in Computer Science","Applications and Theory of Petri Nets"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68746-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T21:55:16Z","timestamp":1557698116000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68746-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540687450","9783540687467"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68746-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}