{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T14:53:25Z","timestamp":1744383205941},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437871"},{"type":"electronic","value":"9783540480686"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48068-4_8","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T07:01:43Z","timestamp":1182150103000},"page":"101-120","source":"Crossref","is-referenced-by-count":30,"title":["Data Decision Diagrams for Petri Net Analysis"],"prefix":"10.1007","author":[{"given":"Jean-Michel","family":"Couvreur","sequence":"first","affiliation":[]},{"given":"Emmanuelle","family":"Encrenaz","sequence":"additional","affiliation":[]},{"given":"Emmanuel","family":"Paviot-Adet","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Poitrenaud","sequence":"additional","affiliation":[]},{"given":"Pierre-Andr\u00e9","family":"Wacrenier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,6]]},"reference":[{"issue":"8","key":"8_CR1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R. Bryant","year":"1986","unstructured":"R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677\u2013691, August 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/3-540-44988-4_8","volume-title":"Proc. of ICATPN\u20192000","author":"G. Ciardo","year":"2000","unstructured":"G. Ciardo, G. L\u00fcttgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. In Proc. of ICATPN\u20192000, volume 1825 of Lecture Notes in Computer Science, pages 103\u2013122. Springer Verlag, 2000."},{"key":"8_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-58152-9_12","volume-title":"Proc. of ICATPN\u201994","author":"J. M. Couvreur","year":"1994","unstructured":"J. M. Couvreur and E. Paviot-Adet. New structural invariants for Petri nets analysis. In Proc. of ICATPN\u201994, volume 815 of Lecture Notes in Computer Science, pages 199\u2013218. Springer Verlag, 1994."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"H. Hulgaard, P. F. Williams, and H. R. Andersen. Equivalence checking of combinational circuits using boolean expression diagrams. IEEE Transactions of Computer-Aided Design, 18(7), July 1999.","DOI":"10.1109\/43.771175"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"T. Kolks, B. Lin, and H. De Man. Sizing and verification of communication buffers for communicating processes. In Proc. of IEEE International Conference on Computer-Aided Design, volume 1825, pages 660\u2013664, Santa Clara, USA, November 1993.","DOI":"10.1109\/ICCAD.1993.580157"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"S. Minato, N. Ishiura, and S. Yajima. Shared binary decision diagrams with attributed edges for efficient boolean function manipulation. In L. J.M Claesen, editor, Proceedings of the 27th ACM\/IEEE Design Automation Conference, DAC\u201990, pages 52\u201357, June 1990.","DOI":"10.1145\/123186.123225"},{"key":"8_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/3-540-48745-X_2","volume-title":"Proc. of ICATPN\u201999","author":"A. S. Miner","year":"1999","unstructured":"A. S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In Proc. of ICATPN\u201999, volume 1639 of Lecture Notes in Computer Science, pages 6\u201325. Springer Verlag, 1999."},{"key":"8_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/3-540-58152-9_23","volume-title":"Proc. of ICATPN\u201994","author":"E. Pastor","year":"1994","unstructured":"E. Pastor, O. Roig, J. Cortadella, and R. M. Badia. Petri net analysis using boolean manipulation. In Proc. of ICATPN\u201994, volume 815 of Lecture Notes in Computer Science, pages 416\u2013435. Springer Verlag, 1994."},{"key":"8_CR9","series-title":"Lect Notes Comput Sci","first-page":"432","volume-title":"Proc. of ICATPN\u201993","author":"R. Valk","year":"1993","unstructured":"R. Valk. Bridging the gap between place-and floyd-invariants with applications to preemptive scheduling. In Proc. of ICATPN\u201993, volume 691 of Lecture Notes in Computer Science, pages 432\u2013452. Springer Verlag, 1993."}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48068-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T23:58:42Z","timestamp":1556495922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48068-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437871","9783540480686"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-48068-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}