{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:55:47Z","timestamp":1762458947005},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581529"},{"type":"electronic","value":"9783540484622"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58152-9_23","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:20:28Z","timestamp":1330269628000},"page":"416-435","source":"Crossref","is-referenced-by-count":81,"title":["Petri net analysis using boolean manipulation"],"prefix":"10.1007","author":[{"given":"Enric","family":"Pastor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oriol","family":"Roig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jordi","family":"Cortadella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rosa M.","family":"Badia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"K. S. Brace, R. L. Rudell, and R. E. Bryant. Efficient implementation of a BDD package. In Proc. of the 27th DAC, pages 40\u201345, June 1990.","key":"23_CR1","DOI":"10.1145\/123186.123222"},{"doi-asserted-by":"crossref","unstructured":"F. M. Brown. Boolean Reasoning: The Logic of Boolean Equations. Kluwer Academic Publishers, 1990.","key":"23_CR2","DOI":"10.1007\/978-1-4757-2078-5"},{"issue":"8","key":"23_CR3","doi-asserted-by":"crossref","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 Transactions on Computers, C-35(8):677\u2013691, August 1986.","journal-title":"IEEE Transactions on Computers"},{"unstructured":"J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Proc. of the Fifth Annual Symposium on Logic in Computer Science, June 1990.","key":"23_CR4"},{"unstructured":"Tam-Anh Chu. Synthesis of Self-timed VLSI Circuits from Graph-theoretic Specifications. Ph.D. thesis, MIT, June 1987.","key":"23_CR5"},{"unstructured":"O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines using boolean functional vectors. In L. Claesen, editor, Proc. IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pages 111\u2013128, Leuven, Belgium, November 1989.","key":"23_CR6"},{"doi-asserted-by":"crossref","unstructured":"L. Lavagno, K. Keutzer, and A. Sangiovanni-Vincentelli. Algorithms for synthesis of hazard-free asynchronous circuits. In Proc. of the 28th. DAC, pages 302\u2013308, June 1991.","key":"23_CR7","DOI":"10.1145\/127601.127685"},{"issue":"4","key":"23_CR8","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C. Y. Lee","year":"1959","unstructured":"C. Y. Lee. Binary decision programs. Bell System Technical Journal, 38(4):985\u2013999, July 1959.","journal-title":"Bell System Technical Journal"},{"issue":"6","key":"23_CR9","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1109\/12.144618","volume":"41","author":"H-T. Liaw","year":"1992","unstructured":"H-T. Liaw and C-S. Lin. On the OBDD representation of generalized boolean functions. IEEE Transactions on Computers, 41(6):661\u2013664, June 1992.","journal-title":"IEEE Transactions on Computers"},{"doi-asserted-by":"crossref","unstructured":"K. L. McMillan. Using Unfoldings to Avoid the State Explosion Problem in Verification of Asynchronous Circuits. In Proc. of the 4th Workshop on Computer-Aided Verification, June 1992.","key":"23_CR10","DOI":"10.1007\/3-540-56496-9_14"},{"issue":"4","key":"23_CR11","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"T. Murata. Petri Nets: Properties, analysis and applications. Proc. of the IEEE, Vol. 77(4):541\u2013574, April 1989.","journal-title":"Proc. of the IEEE"},{"unstructured":"L. Ya. Rosenblum and A. V. Yakovlev. Signal graphs: From self-timed to timed ones. In International Workshop on Timed Petri Nets, pages 199\u2013206, 1985.","key":"23_CR12"},{"doi-asserted-by":"crossref","unstructured":"H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli. Implicit enumeration of finite state machines using BDD's. In Proc. of the ICCAD, pages 130\u2013133, November 1990.","key":"23_CR13","DOI":"10.1109\/ICCAD.1990.129860"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1994"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58152-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:17:22Z","timestamp":1605647842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58152-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581529","9783540484622"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58152-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}