{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:40:10Z","timestamp":1648687210807},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001164","type":"print"},{"value":"9783540361268","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36126-x_6","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:55:19Z","timestamp":1269899719000},"page":"88-105","source":"Crossref","is-referenced-by-count":14,"title":["Analysis of Symbolic SCC Hull Algorithms"],"prefix":"10.1007","author":[{"given":"Fabio","family":"Somenzi","sequence":"first","affiliation":[]},{"given":"Kavita","family":"Ravi","sequence":"additional","affiliation":[]},{"given":"Roderick","family":"Bloem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,5]]},"reference":[{"key":"6_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-40922-X_4","volume-title":"Formal Methods in Computer Aided Design","author":"R. Bloem","year":"2000","unstructured":"R. Bloem, H. N. Gabow, and F. Somenzi. An algorithm for strongly connected component analysis in nlogn symbolic steps. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 37\u201354. Springer-Verlag, November 2000. LNCS 1954."},{"key":"6_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/3-540-61474-5_95","volume-title":"Eighth Conference on Computer Aided Verification (CAV\u201996)","author":"R. K. Brayton","year":"1996","unstructured":"R. K. Braytonet al. VIS: A system for verification and synthesis. In T. Henzinger and R. Alur, editors, Eighth Conference on Computer Aided Verification (CAV\u201996), pages 428\u2013432. Springer-Verlag, Rutgers University, 1996. LNCS 1102."},{"key":"6_CR3","volume-title":"Model Checking","author":"E. M. Clarke","year":"1999","unstructured":"E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, Cambridge, MA, 1999."},{"key":"6_CR4","unstructured":"E. A. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus. In Proceedings of the First Annual Symposium of Logic in Computer Science, pages 267\u2013278, June 1986."},{"key":"6_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-45319-9_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Fisler","year":"2001","unstructured":"K. Fisler, R. Fraer, G. Kamhi, M. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In T. Margaria and W. Yi, editors, Tools and Algorithms for the Construction and Analysis of Systems, pages 420\u2013434. Springer-Verlag, April 2001. LNCS 2031."},{"key":"6_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-63166-6_27","volume-title":"Ninth Conference on Computer Aided Verification (CAV\u201997)","author":"R. H. Hardin","year":"1997","unstructured":"R. H. Hardin, R. P. Kurshan, S. K. Shukla, and M. Y Vardi. A new heuristic for bad cycle detection using BDDs. In O. Grumberg, editor, Ninth Conference on Computer Aided Verification (CAV\u201997), pages 268\u2013278. Springer-Verlag, Berlin, 1997. LNCS 1254."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"R. Hojati, H. Touati, R. P. Kurshan, and R. K. Brayton. Efficient \u03c9-regular language containment. In Computer Aided Verification, pages 371\u2013382, Montr\u00e9al, Canada, June 1992.","DOI":"10.1007\/3-540-56496-9_31"},{"key":"6_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0055036","volume-title":"International Colloquium on Automata, Languages, and Programming (ICALP-98)","author":"Y. Kesten","year":"1998","unstructured":"Y Kesten, A. Pnueli, and L.-o. Raviv. Algorithmic verification of linear temporal logic specifications. In International Colloquium on Automata, Languages, and Programming (ICALP-98), pages 1\u201316, Berlin, 1998. Springer. LNCS 1443."},{"key":"6_CR9","volume-title":"Computer-Aided Verification of Coordinating Processes","author":"R. P. Kurshan","year":"1994","unstructured":"R. P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, Princeton, NJ, 1994."},{"key":"6_CR10","volume-title":"Symbolic Model Checking","author":"K. L. McMillan","year":"1994","unstructured":"K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, Boston, MA, 1994."},{"key":"6_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-40922-X_10","volume-title":"Formal Methods in Computer Aided Design","author":"K. Ravi","year":"2000","unstructured":"K. Ravi, R. Bloem, and F. Somenzi. A comparative study of symbolic algorithms for the computation of fair cycles. In W. A. Hunt, Jr. and S. D. Johnson, editors, Formal Methods in Computer Aided Design, pages 143\u2013160. Springer-Verlag, November 2000. LNCS 1954."},{"key":"6_CR12","unstructured":"F. Somenzi. Symbolic state exploration. Electronic Notes in Theoretical Computer Science, 23, 1999. http:\/\/www.elsevier.nl\/locate\/entcs\/volume23.html ."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"A. Tarski. A lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics, 5:285\u2013309, 1955.","journal-title":"Pacific Journal of Mathematics"},{"key":"6_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1007\/3-540-44685-0_31","volume-title":"International Conference on Concurrency Theory (CONCUR01)","author":"C. Wang","year":"2001","unstructured":"C. Wang, R. Bloem, G. D. Hachtel, K. Ravi, and E Somenzi. Divide and compose: SCC refinement for language emptiness. In International Conference on Concurrency Theory (CONCUR01), pages 456\u2013471, Berlin, August 2001. Springer-Verlag. LNCS 2154."},{"key":"6_CR15","unstructured":"A. Xie and P. A. Beerel. Implicit enumeration of strongly connected components. In Proceedings of the International Conference on Computer-Aided Design, pages 37\u201340, San Jose, CA, November 1999."}],"container-title":["Formal Methods in Computer-Aided Design","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36126-X_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:26:12Z","timestamp":1558985172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36126-X_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001164","9783540361268"],"references-count":15,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-36126-x_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2002]]}}}