{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:47:49Z","timestamp":1725551269156},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001164"},{"type":"electronic","value":"9783540361268"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36126-x_14","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:55:19Z","timestamp":1269899719000},"page":"220-237","source":"Crossref","is-referenced-by-count":9,"title":["Traversal Techniques for Concurrent Systems"],"prefix":"10.1007","author":[{"given":"Marc","family":"Sol\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enric","family":"Pastor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,5]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"R. E. Bryant, \u201cGraph-based algorithms for Boolean function manipulation,\u201d IEEE Trans. Computers, vol. C-35, pp. 677\u2013691, Aug. 1986.","DOI":"10.1109\/TC.1986.1676819"},{"issue":"2","key":"14_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":"J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang, \u201cSymbolic model checking: 1020 states and beyond,\u201d Information and Computation, vol. 98, no. 2, pp. 142\u2013170, 1992.","journal-title":"Information and Computation"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"O. Roig, J. Cortadella, and E. Pastor, \u201cVerification of asynchronous circuits by bdd-based model checking of petri nets,\u201d in 16th International Conference on Application and Theory of Petri Nets, pp. 374\u2013391, June 1995.","DOI":"10.1007\/3-540-60029-9_50"},{"issue":"3","key":"14_CR4","first-page":"315","volume":"E80-D","author":"J. Cortadella","year":"1997","unstructured":"J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev, \u201cPetrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers,\u201d IEICE Transactions on Information and Systems, vol. E80-D, no. 3, pp. 315\u2013325, March 1997.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"A. S. Miner and G. Ciardo, \u201cEfficient reachability set generation and storage using decision diagrams,\u201d in ICATPN, pp. 6\u201325, 1999.","DOI":"10.1007\/3-540-48745-X_2"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/12.926158","volume":"50","author":"J. C. E. Pastor","year":"2001","unstructured":"J. C. E. Pastor and O. Roig, \u201cSymbolic analysis of bounded petri nets,\u201d IEEE Transactions on Computers, vol. 50, no. 5, pp. pp. 432\u2013448, May 2001.","journal-title":"IEEE Transactions on Computers"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"K. Ravi and F. Somenzi, \u201cHigh-density reachability analysis,\u201d in Proc. of the IEEE\/ACM International Conference on Computer Aided Design, pp. 154\u2013158, 1995.","DOI":"10.1109\/ICCAD.1995.480006"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"G. Cabodi, P. Camurati, and S. Quer, \u201cImproving symbolic traversals by means of activity profiles,\u201d in Design Automation Conference, pp. 306\u2013311, 1999.","DOI":"10.1145\/309847.309938"},{"key":"14_CR9","unstructured":"A. Hett, C. Scholl, and B. Becker, \u201cState traversal guided by hamming distance profiles.\u201d"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"K. Ravi and F. Somenzi, \u201cHints to accelerate symbolic traversal,\u201d in Conference on Correct Hardware Design and Verification Methods, pp. 250\u2013264, 1999.","DOI":"10.1007\/3-540-48153-2_19"},{"key":"14_CR11","unstructured":"A. Arnold, Finite Transition Systems. Prentice Hall, 1994."},{"key":"14_CR12","series-title":"PhD thesis","volume-title":"Kommunikation mit Automaten","author":"C. Petri","year":"1962","unstructured":"C. Petri, Kommunikation mit Automaten. PhD thesis, Schriften des Institutes f\u00fcr Instrumentelle Matematik, Bonn, 1962."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"M. R. Greenstreet and T. Ono-Tesfaye, \u201cA fast, ASP*, RGD arbiter,\u201d in Proceedings of the Fifth International Symposium on Advanced Research in Asynchronous Circuits and Systems, (Barcelona, Spain), pp. 173\u2013185, IEEE, Apr. 1999.","DOI":"10.1109\/ASYNC.1999.761532"},{"key":"14_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60761-7","volume-title":"Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem","author":"P. Godefroid","year":"1996","unstructured":"P. Godefroid, Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem, vol. 1032. New York, NY, USA: Springer-Verlag Inc., 1996."}],"container-title":["Lecture Notes in Computer Science","Formal Methods in Computer-Aided Design"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36126-X_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:25:52Z","timestamp":1558985152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36126-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001164","9783540361268"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-36126-x_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}