{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:58:42Z","timestamp":1761807522086,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423454"},{"type":"electronic","value":"9783540445852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44585-4_8","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T19:39:50Z","timestamp":1265917190000},"page":"79-90","source":"Crossref","is-referenced-by-count":21,"title":["A Fast Bisimulation Algorithm"],"prefix":"10.1007","author":[{"given":"Agostino","family":"Dovier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carla","family":"Piazza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes","volume-title":"Non-well-founded sets","author":"P. Aczel","year":"1988","unstructured":"P. Aczel. Non-well-founded sets, volume 14 of Lecture Notes, Center for the Study of Language and Information. Stanford, 1988."},{"key":"8_CR2","unstructured":"A. Aziz, V. Singhal, G. Swamy, and R. Brayton. Minimizing interacting finite state machines: a compositional approach to language containment. In Proc. Int'l Conference on Computer Design, 1994."},{"key":"8_CR3","series-title":"Lecture Notes","volume-title":"Vicious Circles. On the Mathematics of non-well-founded phenomena","author":"J. Barwise","year":"1996","unstructured":"J. Barwise and L. Moss. Vicious Circles. On the Mathematics of non-well-founded phenomena. Lecture Notes, Center for the Study of Language and Information. Stanford, 1996."},{"key":"8_CR4","series-title":"Lect Notes Comput Sci","first-page":"197","volume-title":"Minimal model generation","author":"A. Bouajjani","year":"1990","unstructured":"A. Bouajjani, J.C. Fernandez, and N. Halbwachs. Minimal model generation. In E. Clarke and R. Kurshan, editors, Proc. Int'l Conference on Computer-Aided Verification CAV\u201990, volume 531 of LNCS, pages 197\u2013203. Springer, 1990."},{"key":"8_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1007\/BFb0028770","volume-title":"XEVE, an ESTEREL verification environment","author":"A. Bouali","year":"1998","unstructured":"A. Bouali. XEVE, an ESTEREL verification environment. In A. J. Hu and M. Y. Vardi, editors, Proc. Int'l Conference on Computer-Aided Verification CAV\u201998, LNCS, pages 500\u2013504. Springer, 1998."},{"key":"8_CR6","series-title":"Lect Notes Comput Sci","first-page":"96","volume-title":"Symbolic bisimulation minimization","author":"A. Bouali","year":"1992","unstructured":"A. Bouali and R. de Simone. Symbolic bisimulation minimization. In Proc. Int'l Conference on Computer-Aided Verification CAV\u201992, volume 663 of LNCS, pages 96\u2013108. Springer, 1992."},{"issue":"8","key":"8_CR7","doi-asserted-by":"publisher","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 Transaction on Computers, C-35(8):677\u2013691, 1986.","journal-title":"IEEE Transaction on Computers"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, and B. Steffen. The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 15(1):36\u201372, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"8_CR9","unstructured":"A. Dovier, C. Piazza, and A. Policriti. A fast bisimulation algorithm. TR UDMI\/14\/00\/RR, Dip. di Matematica e Informatica, Univ. di Udine, 2000. http:\/\/www.dimi.uniud.it\/~piazza\/bisim.ps.gz ."},{"key":"8_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/3-540-48153-2_29","volume-title":"Bisimulation and model checking","author":"K. Fisler","year":"1999","unstructured":"K. Fisler and M.Y. Vardi. Bisimulation and model checking. In Proc. Correct Hardware Design and Verification Methods, volume 1703 of LNCS, pages 338\u2013341. Springer, 1999."},{"issue":"10","key":"8_CR11","first-page":"493","volume":"IV","author":"M. Forti","year":"1983","unstructured":"M. Forti and F. Honsell. Set theory with free construction principles. Annali Scuola Normale Superiore di Pisa, Cl. Sc., IV(10):493\u2013522, 1983.","journal-title":"Annali Scuola Normale Superiore di Pisa, Cl. Sc."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"M.R. Henzinger, T.A. Henzinger, and P.W. Kopke. Computing simulations on finite and infinite graphs. In Proc. 36th IEEE Symp. on Foundations of Computer Science, FOCS 1995, pages 453\u2013462, 1995.","DOI":"10.1109\/SFCS.1995.492576"},{"key":"8_CR13","unstructured":"G.J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, 1991."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"G.J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23(5), 1997.","DOI":"10.1109\/32.588521"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/s100090050034","volume":"2","author":"G.J. Holzmann","year":"1999","unstructured":"G.J. Holzmann and A. Puri. A minimized automaton representation of reachable states. Software Tools for Technology Transfer, 2(3):270\u2013278, November 1999.","journal-title":"Software Tools for Technology Transfer"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"J.E. Hopcroft. An n log n algorithm for minimizing states in a finite automaton. In Theory of Machines and Computations, Ed. by Zvi Kohavi and Azaria Paz, pages 189\u2013196. Academic Press, 1971.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P.C. Kanellakis","year":"1990","unstructured":"P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. Information and Computation, 86(1):43\u201368, 1990.","journal-title":"Information and Computation"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"D. Lee and M. Yannakakis. Online minimization of transition systems. In Proc. 24th ACM Symposium on Theory of Computing, pages 264\u2013274, May 1992.","DOI":"10.1145\/129712.129738"},{"issue":"6","key":"8_CR19","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R.E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"8_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"R. Paige, R.E. Tarjan, and R. Bonic. A linear time solution to the single function coarsest partition problem. Theoretical Computer Science, 40(1):67\u201384, 1985.","journal-title":"Theoretical Computer Science"},{"key":"8_CR21","unstructured":"F. Rahim. Property-dependent modular model checking application to VHDL with computational results. In Proc. Int'l Workshop HLDVT, 1998."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44585-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T10:27:34Z","timestamp":1739874454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44585-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423454","9783540445852"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44585-4_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}