{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:10:51Z","timestamp":1761610251367,"version":"build-2065373602"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3954,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1571-0661(04)80547-4","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"166-183","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Rank-Based Symbolic Bisimulation"],"prefix":"10.1016","volume":"67","author":[{"given":"A.","family":"Dovier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Gentilini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Piazza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB1","unstructured":"Aczel., P., \u201cNon-well-founded sets.\u201d Lecture Notes, Center for the Study of Language and Information 14, Stanford, 1988."},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","article-title":"Binary decision diagrams","volume":"27","author":"Akers","year":"1978","journal-title":"IEEE Transaction on Computers"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Bloem R., H. N. Gabow and F. Somenzi, An algorithm for strongly connected component analysis in n log n symbolic steps, in: W. A. Hunt Jr. and S. D. Johnson, editors, Proc. of Int. Conference on Formal Methods in Computer-Aided Design (FMCAD'00), LNCS 1954 (2000), pp. 37\u201354.","DOI":"10.1007\/3-540-40922-X_4"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB4","doi-asserted-by":"crossref","unstructured":"Bouajjani A., J. C. Fernandez and N. Halbwachs, Minimal model generation, in: E. M. Clarke and R. Kurshan, editors, Proc. Int'l Conference on Computer-Aided Verification CAV90, LNCS 531 (1990), pp. 197\u2013203.","DOI":"10.1007\/BFb0023733"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Bouali A. and R. de Simone, Symbolic bisimulation minimization, in: Proc. Int'l Conference on Computer-Aided Verification CAV92, LNCS 663 (1992), pp. 96\u2013108.","DOI":"10.1007\/3-540-56496-9_9"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Bryant, R. E., Symbolic manipulation of boolean functions using a graphical representation, in: Proc. 22nd Design Automation Conference, 1985.","DOI":"10.1109\/DAC.1985.1586017"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB7","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","article-title":"Graph based algorithms for boolean function manipulation","volume":"C-35","author":"Bryant","year":"1986","journal-title":"IEEE Trans. on Computers"},{"year":"1999","series-title":"\u201cModel checking\u201d","author":"Clarke","key":"10.1016\/S1571-0661(04)80547-4_NEWBIB8"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Dovier A., C. Piazza and A. Policriti, A fast bisimulation algorithm, in: G. Berry, H. Comon and A. Finkel, editors, Proc. of Int. Conference on Computer Aided Verification (CAV'01), LNCS 2102 (2001), pp. 79\u201390.","DOI":"10.1007\/3-540-44585-4_8"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Fisler K. and M. Y. Vardi, Bisimulation and model checking, in: Proc. Correct Hardware Design and Verification Methods, LNCS 1703 (1999), pp. 338\u2013341.","DOI":"10.1007\/3-540-48153-2_29"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB11","series-title":"Theory of Machines and Computations","first-page":"189","article-title":"An nlogn algorithm for minimizing states in a finite automaton","author":"Hopcroft","year":"1971"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB12","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","article-title":"Binary decision programs","volume":"38","author":"Lee","year":"1959","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB13","doi-asserted-by":"crossref","unstructured":"Lee D. and M. Yannakakis, Online minimization of transition systems, in: Proc. 24th ACM Symposium on Theory of Computing, 1992, pp. 264\u2013274.","DOI":"10.1145\/129712.129738"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Lee D. and M. Yannakakis, Online minimization of transition systems, in: Proc. of 24th ACM Symposium on Theory of Computing (STOC'92) (1992), pp. 264\u2013274.","DOI":"10.1145\/129712.129738"},{"year":"1993","series-title":"\u201cSymbolic model checking: an approach to the state explosion problem\u201d","author":"McMillan","key":"10.1016\/S1571-0661(04)80547-4_NEWBIB15"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB16","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM Journal on Computing"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","article-title":"A linear time solution to the single function coarsest partition problem","volume":"40","author":"Paige","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB18","doi-asserted-by":"crossref","unstructured":"Sanghavi, J. V., R. K. Ranjan, R. K. Brayton, and A. Sangiovanni-Vincentelli, High performance bdd package based on exploiting memory hierarchy, in: Proc. of ACM\/IEEE Design Automation Conference, 1996.","DOI":"10.1145\/240518.240638"},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB19","unstructured":"Somenzi F., Binary decision diagrams (1999), available at http:\/\/citeseer.nj.nec.com\/somenzi99binary.html."},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB20","unstructured":"Somenzi F., \u201cCUDD: CU Decision Diagram Package Release 2.3.1,\u201d 2001, available at http:\/\/vlsi.colorado.edu\/fabio\/CUDD\/cuddIntro.html."},{"key":"10.1016\/S1571-0661(04)80547-4_NEWBIB21","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM Journal on Computing"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805474?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805474?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:57Z","timestamp":1761609957000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":21,"alternative-id":["S1571066104805474"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80547-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Rank-Based Symbolic Bisimulation","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80547-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}