{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T23:50:10Z","timestamp":1780098610024,"version":"3.54.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540528261","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032063","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:05:31Z","timestamp":1134263131000},"page":"626-638","source":"Crossref","is-referenced-by-count":113,"title":["An efficient algorithm for branching bisimulation and stuttering equivalence"],"prefix":"10.1007","author":[{"given":"Jan Friso","family":"Groote","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frits","family":"Vaandrager","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"A.V. Aho, J.E. Hopcroft & J.D. Ullman (1974): The design and analysis of computer algorithms, Addison-Wesley."},{"key":"47_CR2","unstructured":"T. Bolognesi & S.A. Smolka (1987): Fundamental results for the verification of observational equivalence: a survey. In: Proceedings 7th IFIP WG6.1 International Symposium on Protocol Specification, Testing, and Verification, Z\u00fcrich, Switserland, May 1987 (H. Rudin & C. West, eds.), North-Holland."},{"issue":"12","key":"47_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"M.C. Browne","year":"1988","unstructured":"M.C. Browne, E.M. Clarke & O. Grumberg (1988): Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science 59(1,2), pp. 115\u2013131.","journal-title":"Theoretical Computer Science"},{"key":"47_CR4","unstructured":"E.M. Clarke & E.A. Emerson (1981): Synthesis of synchronization skeletons for branching time temporal logic. In: Proceedings of the Workshop on Logic of Programs, Springer-Verlag, pp. 52\u201371."},{"key":"47_CR5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1146\/annurev.cs.02.060187.001413","volume":"2","author":"E.M. Clarke","year":"1987","unstructured":"E.M. Clarke & O. Grumberg (1987): Research on automatic verification of finite state concurrent systems. Ann. Rev. Comput. Sci. 2, pp. 269\u2013290.","journal-title":"Ann. Rev. Comput. Sci."},{"key":"47_CR6","first-page":"353","volume-title":"Proceedings 4 th Annual Symposium on Logic in Computer Science (LICS)","author":"E.M. Clarke","year":"1989","unstructured":"E.M. Clarke, D.E. Long & K.L. McMillan (1989): Compositional model checking. In: Proceedings 4 th Annual Symposium on Logic in Computer Science (LICS), Asilomar, California, IEEE Computer Society Press, Washington, pp. 353\u2013362."},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"D. Coppersmith & S. Winograd (1987): Matrix multiplication via arithmetic progressions. In: Proceedings 19 th ACM Symposium on Theory of Computing, New York City, NY, pp. 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"R. De Nicola, U. Montanari & F.W. Vaandrager (1990): Back and forth bisimulations, submitted for publication.","DOI":"10.1007\/BFb0039058"},{"key":"47_CR9","unstructured":"R. De Nicola & F.W. Vaandrager (1990): Three logics for branching bisimulation, to appear as: CWI Report CS-R90... Extended abstract to appear in: Proceedings LICS 90."},{"issue":"1","key":"47_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"E.A. Emerson & J.Y. Halpern (1986): 'sometimes\u2019 and \u2018Not Never\u2019 revisited: on branching time versus linear time temporal logic. JACM 33(1), pp. 151\u2013178.","journal-title":"JACM"},{"key":"47_CR11","unstructured":"J.C. Fernandez (1989): An implementation of an efficient algorithm for bisimulation equivalence."},{"key":"47_CR12","unstructured":"R.J. van Glabbeek & W.P. Weijland (1989): Branching time and abstraction in bisimulation semantics (extended abstract). In: Information Processing 89 (G.X. Ritter, ed.), Elsevier Science Publishers B.V. (North Holland), pp. 613\u2013618."},{"key":"47_CR13","volume-title":"Refinement in branching time semantics. Report CS-R8922","author":"R.J. Glabbeek van","year":"1989","unstructured":"R.J. van Glabbeek & W.P. Weijland (1989): Refinement in branching time semantics. Report CS-R8922, Centrum voor Wiskunde en Informatica, Amsterdam, also appeared in: Proceedings AMAST Conference, May 1989, Iowa, USA, pp. 197\u2013201."},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"P.C. Kanellakis & S.A. Smolka (1983): CCS expressions, finite state processes, and three problems of equivalence. In: 2 nd ACM Symposium on Principles of Distributed Computing (PODC), Montreal, Quebec, Canada, August 1983, to appear in: Information & Computation.","DOI":"10.1145\/800221.806724"},{"key":"47_CR15","unstructured":"L. Lamport (1983): What good is temporal logic?. In: Information Processing 83 (R.E. Mason, ed.), Elsevier Science Publishers B.V. (North Holland), pp. 657\u2013668."},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"R. Milner (1980): A Calculus of Communicating Systems, LNCS 92, Springer-Verlag.","DOI":"10.1007\/3-540-10235-3"},{"issue":"6","key":"47_CR17","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige & R. Tarjan (1987): Three partition refinement algorithms. SIAM Journal on Computing 16(6), pp. 973\u2013989.","journal-title":"SIAM Journal on Computing"},{"key":"47_CR18","series-title":"Technical Report","volume-title":"Aboard AUTO","author":"R. Simone de","year":"1989","unstructured":"R. de Simone & D. Vergamini (1989): Aboard AUTO. Technical Report 11, INRIA, Centre Sophia-Antipolis, Valbonne Cedex."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:45:22Z","timestamp":1586598322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0032063","relation":{},"subject":[]}}