{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T06:19:15Z","timestamp":1782368355965,"version":"3.54.5"},"reference-count":47,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0304-3975(03)00361-x","type":"journal-article","created":{"date-parts":[[2003,7,16]],"date-time":"2003-07-16T18:00:25Z","timestamp":1058378425000},"page":"221-256","source":"Crossref","is-referenced-by-count":92,"title":["An efficient algorithm for computing bisimulation equivalence"],"prefix":"10.1016","volume":"311","author":[{"given":"Agostino","family":"Dovier","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carla","family":"Piazza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00361-X_BIB1","unstructured":"P. Aczel, Non-Well-Founded Sets, CSLI Lecture Notes, Vol. 14, Stanford University Press, Standford, 1988."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB2","doi-asserted-by":"crossref","unstructured":"A. Aziz, V. Sighal, G. Swamy, R. Brayton, Minimizing interacting finite state machines: a compositional approach to language containment, in: Proc. Internat. Conf. on Computer Design (ICCD\u201994), IEEE Computer Society Press, Silver Spring, MD, 1994, pp. 255\u2013261.","DOI":"10.1109\/ICCD.1994.331900"},{"issue":"4","key":"10.1016\/S0304-3975(03)00361-X_BIB3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF03028340","article-title":"Hypersets","volume":"13","author":"Barwise","year":"1991","journal-title":"The Math. Intelligencer"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB4","unstructured":"J. Barwise, L. Moss, vicious circles. On the Mathematics of non-well-founded phenomena, CSLI Lecture Notes, Vol. 60, Stanford University Press, Stanford, 1996."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB5","unstructured":"J. van Benthem, Modal correspondence theory, Ph.D. Thesis, Universiteit van Amsterdam, Instituut voor Logica en Grondslagenonderzo ek van Exacte Wetenschappen, 1976."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB6","unstructured":"R. Bloem, H.N. Gabow, F. Somenzi, An algorithm for strongly connected component analysis in nlogn symbolic steps, in: W.A. Hunt Jr., S.D. Johnson, (Eds.), Proc. Internat. Conf. on Formal Methods in Computer-Aided Design (FMCAD\u201900), Lecture Notes in Computer Science, Vol. 1954, Springer, Berlin, 2000, pp. 37\u201354."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB7","doi-asserted-by":"crossref","unstructured":"A. Bouajjani, J.C. Fernandez, N. Halbwachs, Minimal model generation, in: E. Clarke, R. Kurshan (Eds.), Proc. Internat. Conf. on Computer Aided Verification (CAV\u201990), Lecture Notes in Computer Science, Vol. 531, Springer, Berlin, 1990, pp. 197\u2013203.","DOI":"10.1007\/BFb0023733"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB8","doi-asserted-by":"crossref","unstructured":"A. Bouali, XEVE, an ESTEREL verification environment, in: A.J. Hu, M.Y. Vardi (Eds.), Proc. Internat. Conf. on Computer Aided Verification (CAV\u201998), Lecture Notes in Computer Science, Vol. 1427, Springer, Berlin, 1998, pp. 500\u2013504.","DOI":"10.1007\/BFb0028770"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB9","doi-asserted-by":"crossref","unstructured":"A. Bouali, R. de Simone, Symbolic bisimulation minimization, in: G. von Bochmann, D.K. Probst (Eds.), Proc. Internat. Conf. on Computer Aided Verification (CAV\u201992), Lecture Notes in Computer Science, Vol. 663, Springer, Berlin, 1992, pp. 96\u2013108.","DOI":"10.1007\/3-540-56496-9_9"},{"issue":"8","key":"10.1016\/S0304-3975(03)00361-X_BIB10","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. Comput."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB11","doi-asserted-by":"crossref","unstructured":"D. Bustan, O. Grumberg, Simulation based minimization, in: D.A. McAllester (Ed.), Proc. 17th Internat. Conf. on Automated Deduction (CADE\u201900), Lecture Notes in Computer Science, Vol. 1831, Springer, Berlin, 2000, pp. 255\u2013270.","DOI":"10.1007\/10721959_20"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB12","doi-asserted-by":"crossref","unstructured":"D. Cantone, E.G. Omodeo, A. Policriti, Set theory for computing. From decision procedures to declarative programming with sets, Monographs in Computer Science, Springer, Berlin, 2001.","DOI":"10.1007\/978-1-4757-3452-2"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB13","series-title":"Model Checking","author":"Clarke","year":"1999"},{"issue":"1","key":"10.1016\/S0304-3975(03)00361-X_BIB14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/151646.151648","article-title":"The concurrency workbench","volume":"15","author":"Cleaveland","year":"1993","journal-title":"ACM Trans. Programming Languages Systems"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB15","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, S. Sims, The NCSU concurrency workbench, in: R. Alur, T.A. Henzinger (Eds.), Proc. Internat. Conf. on Computer Aided Verification (CAV\u201996), Lecture Notes in Computer Science, LNCS, Vol. 1102, Springer, Berlin, pp. 394\u2013397.","DOI":"10.1007\/3-540-61474-5_87"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB16","series-title":"Handbook of Process Algebra","first-page":"391","article-title":"Equivalence and preorder checking for finite-state systems","author":"Cleaveland","year":"2001"},{"issue":"1\u20132","key":"10.1016\/S0304-3975(03)00361-X_BIB17","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0304-3975(01)00295-X","article-title":"Operational and abstract semantics of the query language G-Log","volume":"275","author":"Cortesi","year":"2002","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/S0304-3975(03)00361-X_BIB18","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","article-title":"An O(nlogn) unidirectional distributed algorithm for extrema finding in a circle","volume":"3","author":"Dolev","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB19","doi-asserted-by":"crossref","unstructured":"A. Dovier, R. Gentilini, C. Piazza, A. Policriti, Rank-based symbolic bisimulation (and model checking), in: R.J. Guerra, B. de Queiroz (Eds.), WoLLIC\u20192002, 9th Workshop on Logic, Language, Information and Computation, Electronic Notes in Theoretical Computer Science, Vol. 67, Elsevier, Amsterdam, 2002.","DOI":"10.1016\/S1571-0661(04)80547-4"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB20","doi-asserted-by":"crossref","unstructured":"A. Dovier, C. Piazza, A. Policriti, A fast bisimulation algorithm, in: G. Berry, H. Comon, A. Finkel (Eds.), Proc. Internat. Conf. on Computer Aided Verification (CAV\u201901), Lecture Notes in Computer Science, Vol. 2102, Springer, Berlin, 2001, pp. 79\u201390.","DOI":"10.1007\/3-540-44585-4_8"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB21","doi-asserted-by":"crossref","unstructured":"J.C. Fernandez, H. Garavel, A. Kerbrat, R. Mateescu, L. Mounier, M. Sighireanu, CADP: a protocol validation and verification toolbox, in: R. Alur, T.A. Henzinger (Eds.), Proc. Internat. Conf. on Computer Aided Verification (CAV\u201996), Lecture Notes in Computer Science, Vol. 1102, Springer, Berlin, 1996, pp. 437\u2013440.","DOI":"10.1007\/3-540-61474-5_97"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB22","doi-asserted-by":"crossref","unstructured":"K. Fisler, M.Y. Vardi, Bisimulation and model checking, in: L. Pierre, T. Kropf (Eds.), Proc. Correct Hardware Design and Verification Methods (CHARME\u201999), Lecture Notes in Computer Science, Vol. 1703, Springer, Berlin, 1999, pp. 338\u2013341.","DOI":"10.1007\/3-540-48153-2_29"},{"issue":"9","key":"10.1016\/S0304-3975(03)00361-X_BIB23","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1109\/32.629493","article-title":"The compositional security checker","volume":"23","author":"Focardi","year":"1997","journal-title":"IEEE Trans. Software Eng."},{"issue":"10","key":"10.1016\/S0304-3975(03)00361-X_BIB24","first-page":"493","article-title":"Set theory with free construction principles","volume":"IV","author":"Forti","year":"1983","journal-title":"Annali Scuola Normale Superiore Pisa, Cl. Sc."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB25","doi-asserted-by":"crossref","unstructured":"R. Gentilini, C. Piazza, A. Policriti, Simulation as coarsest partition problem, in: J.-P. Katoen, P. Stevens (Eds.), Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS-02), Lecture Notes in Computer Science, Vol. 2280, Springer, Berlin, 2002, pp. 415\u2013430.","DOI":"10.1007\/3-540-46002-0_29"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB26","unstructured":"R. Gentilini, C. Piazza, A. Policriti, Computing strongly connected components in a linear number of symbolic steps, in: Proc. of Internat. Symp. on Discrete Algorithms (SODA\u201903), ACM, New York, 2003, pp. 573\u2013582."},{"issue":"2","key":"10.1016\/S0304-3975(03)00361-X_BIB27","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","article-title":"Symbolic bisimulations","volume":"138","author":"Hennessy","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB28","doi-asserted-by":"crossref","unstructured":"M.R. Henzinger, T.A. Henzinger, P.W. Kopke, Computing simulations on finite and infinite graphs, in: Proc. 36th IEEE Symp. on Foundations of Computer Science, (FOCS\u20191995), IEEE Computer Society Press, Silver Spring, MD, 1995, pp. 453\u2013462.","DOI":"10.1109\/SFCS.1995.492576"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB29","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1017\/S0960129500000992","article-title":"A polynomial time algorithm for deciding bisimulation equivalence of normed basic parallel processes","volume":"6","author":"Hirshfeld","year":"1996","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB30","series-title":"Design and Validation of Computer Protocols","author":"Holzmann","year":"1991"},{"issue":"5","key":"10.1016\/S0304-3975(03)00361-X_BIB31","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/32.588521","article-title":"The model checker SPIN","volume":"23","author":"Holzmann","year":"1997","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"10.1016\/S0304-3975(03)00361-X_BIB32","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/s100090050034","article-title":"A minimized automaton representation of reachable states","volume":"2","author":"Holzmann","year":"1999","journal-title":"Software Tools Technol. Transfer"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB33","doi-asserted-by":"crossref","unstructured":"J.E. Hopcroft, An nlogn algorithm for minimizing states in a finite automaton, in: Kohavi, Paz (Eds.), Theory of Machines and Computations, Academic Press, New York, 1971, pp. 189\u2013196.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"issue":"1","key":"10.1016\/S0304-3975(03)00361-X_BIB34","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS expressions, finite state processes, and three problems of equivalence","volume":"86","author":"Kannellakis","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB35","doi-asserted-by":"crossref","unstructured":"D. Lee, M. Yannakakis, Online minimization of transition systems, in: Proc. 24th ACM Symposium on Theory of Computing (STOC\u201992), ACM Press, New York, 1992, pp. 264\u2013274.","DOI":"10.1145\/129712.129738"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB36","doi-asserted-by":"crossref","unstructured":"A. Lisitsa, P. Sazonov, V. Yu, Bounded hyperset theory and web-like data bases, in: Gottlob, Leitsch, Mundici (Eds.), Proc. Computational Logic and Proof Theory, 5th Kurt G\u00f6del Colloquium, Lecture Notes in Computer Science, Vol. 1289, Springer, Berlin, 1997, pp. 172\u2013185.","DOI":"10.1007\/3-540-63385-5_42"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB37","series-title":"Symbolic Model Checking: An Approach to the State Explosion Problem","author":"McMillan","year":"1993"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB38","doi-asserted-by":"crossref","unstructured":"R. Milner, Operational and algebraic semantics of concurrent processes, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier Science, Amsterdam, 1990 (Chapter 19).","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB39","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":"Theoret. Comput. Sci."},{"issue":"6","key":"10.1016\/S0304-3975(03)00361-X_BIB40","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 J. Comput."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB41","doi-asserted-by":"crossref","unstructured":"D. Park, Concurrency and automata on infinite sequences, in: P. Deussen (Ed.), Proc. 5th Internat. Conf. on Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 104, Springer, Berlin, 1981, pp. 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB42","unstructured":"F. Rahim, Property-dependent modular model checking application to VHDL with computational results, in: Proc. Internat. Workshop HLDVT, La Jolla, California, 1998."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB43","series-title":"A Classical Mind: Essays in Honour of C.A.R. Hoare","article-title":"Model checking CSP","author":"Roscoe","year":"1994"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB44","doi-asserted-by":"crossref","unstructured":"J.V. Sanghavi, R.K. Ranjan, R.K. Brayton, A. Sangiovanni-Vincentelli, High performance bdd package based on exploiting memory hierarchy, in: Proc. ACM\/IEEE Design Automation Conference, Las Vegas, Nevada, 1996.","DOI":"10.1145\/240518.240638"},{"key":"10.1016\/S0304-3975(03)00361-X_BIB45","unstructured":"F. Somenzi, Binary decision diagrams, in: Calculational System Design, NATO Science Series F: Computer and Systems Sciences, Vol. 173, IOS Press, Amsterdam, 1999, pp. 303\u2013366."},{"key":"10.1016\/S0304-3975(03)00361-X_BIB46","unstructured":"F. Somenzi, CUDD: CU decision diagram package release 2.3.1, Department of Electrical and Computer Engineering University of Colorado at Boulder, 2001. Available at http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/cuddIntro.html."},{"issue":"2","key":"10.1016\/S0304-3975(03)00361-X_BIB47","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 J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750300361X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439750300361X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T18:33:21Z","timestamp":1585074801000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439750300361X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":47,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S030439750300361X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00361-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}