{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:40:32Z","timestamp":1769974832531,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540372134","type":"print"},{"value":"9783540372141","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11812128_21","type":"book-chapter","created":{"date-parts":[[2006,8,9]],"date-time":"2006-08-09T09:32:31Z","timestamp":1155115951000},"page":"219-229","source":"Crossref","is-referenced-by-count":2,"title":["On-the-Fly Branching Bisimulation Minimization for Compositional Analysis"],"prefix":"10.1007","author":[{"given":"Yung-Pin","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong-Yi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Ru","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-540-31980-1_42","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Bergamini","year":"2005","unstructured":"Bergamini, D., Descoubes, N., Joubert, C., Mateescu, R.: BISIMULATOR: A modular tool for on-the-fly equivalence checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 613\u2013618. Springer, Heidelberg (2005)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-45657-0_50","volume-title":"Computer Aided Verification","author":"S. Blom","year":"2002","unstructured":"Blom, S., van de Pol, J.: State space reduction by proving confluence. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 596\u2013609. Springer, Heidelberg (2002)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/BFb0023733","volume-title":"Computer-Aided Verification","author":"A. Bouajjani","year":"1991","unstructured":"Bouajjani, A., Fernandez, J.-C., Halbwachs, N.: Minimal model generation. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol.\u00a0531, pp. 197\u2013203. Springer, Heidelberg (1991)"},{"key":"21_CR4","unstructured":"Bouali, A.: Weak and branching bisimulation in fctool. Technical Report Technical Report 1575, INRIA, Sophia Antipolis, Valbonne Cedex, France (1992)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Cheng, Y.: Refactoring design models for inductive verification. In: Proceedings of International Symposium on Software Testing and Analysis (ISSTA 2002), Rome, Italy, pp. 164\u2013168 (July 2002)","DOI":"10.1145\/566172.566198"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Cheng, Y.-P., Young, M., Huang, C.-L., Pan, C.-Y.: Towards scalable compositional analysis by refactoring design models. In: Proceedings of the ACM SIGSOFT 2003 Symposium on the Foundations of Software Engineering, pp. 247\u2013256 (2003)","DOI":"10.1145\/940071.940105"},{"issue":"4","key":"21_CR7","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1145\/235321.235323","volume":"5","author":"S.C. Cheung","year":"1996","unstructured":"Cheung, S.C., Kramer, J.: Context constraints for compositional reachability analysis. ACM Transactions on Software Engineering and Methodology\u00a05(4), 334\u2013377 (1996)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"21_CR8","unstructured":"Dams, D., Groote, J.: Specification and implementation of components of a $\\pounds$ gCRL toolbox. Technical Report 152, Logic Group Preprint, SeriesUtrecht University (1995), http:\/\/homepages.cwi.nl\/~mcrl"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR \u201991","author":"J.-C. Fernandez","year":"1991","unstructured":"Fernandez, J.-C., Mounier, L.: A tool set for deciding behavioral equivalences. In: Groote, J.F., Baeten, J.C.M. (eds.) CONCUR 1991. LNCS, vol.\u00a0527. Springer, Heidelberg (1991)"},{"key":"21_CR10","first-page":"13","volume":"4","author":"H. Garavel","year":"2002","unstructured":"Garavel, H., Lang, F., Mateescu, R.: An overview of cadp 2001. European Association for Software Science and Technology (EASST) Newsletter\u00a04, 13\u201324 (2002)","journal-title":"European Association for Software Science and Technology (EASST) Newsletter"},{"key":"21_CR11","first-page":"613","volume-title":"Information Processing 1989","author":"R.V. Glabbeek","year":"1989","unstructured":"Glabbeek, R.V., Weijland, W.P.: Branching time and abstraction in bisimulation semantics (extended abstract). In: Information Processing 1989, pp. 613\u2013618. North-Holland, Amsterdam (1989)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BFb0023732","volume-title":"Computer-Aided Verification","author":"S. Graf","year":"1991","unstructured":"Graf, S., Steffen, B.: Compositional minimization of finite state systems. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol.\u00a0531, pp. 186\u2013204. Springer, Heidelberg (1991)"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Groote, J., Vaandrager, F.: An efficient algorithm for branching bisimulation and stuttering equivalence. In: ICALP (1990)","DOI":"10.1007\/BFb0032063"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/3-540-44612-5_34","volume-title":"Mathematical Foundations of Computer Science 2000","author":"J.F. Groote","year":"2000","unstructured":"Groote, J.F., van de Pol, J.: State space reduction using partial \u03c4-confluence. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 383\u2013393. Springer, Heidelberg (2000)"},{"key":"21_CR15","volume-title":"Design and Validation of Computer Protocols","author":"G.J. Holzmann","year":"1991","unstructured":"Holzmann, G.J.: Design and Validation of Computer Protocols. Prentice-Hall, Englewood Cliffs, 07632 (1991)"},{"issue":"5","key":"21_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker SPIN. Software Engineering\u00a023(5), 279\u2013295 (1997)","journal-title":"Software Engineering"},{"key":"21_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":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation\u00a086, 43\u201368 (1990)","journal-title":"Information and Computation"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Lee, D., Yannakakis, M.: Online minimization of transition systems. In: Proceedings of 24th ACM Symposium on Theory of Computing, Victoria, pp. 264\u2013274 (May 1992)","DOI":"10.1145\/129712.129738"},{"key":"21_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic model checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic model checking. Kluwer Academic Publishers, Massachusetts (1993)"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-45069-6_41","volume-title":"Computer Aided Verification","author":"G. Pace","year":"2003","unstructured":"Pace, G., Lang, F., Mateescu, R.: Calculating tau-confluence compositionally. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 446\u2013459. Springer, Heidelberg (2003)"},{"key":"21_CR22","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/120807.120812","volume-title":"Proceedings of the Symposium on Software Testing, Analysis, and Verification (TAV4). ACM SIGSOFT","author":"W.J. Yeh","year":"1991","unstructured":"Yeh, W.J., Young, M.: Compositional reachability analysis using process algebra. In: Proceedings of the Symposium on Software Testing, Analysis, and Verification (TAV4). ACM SIGSOFT, Victoria, British Columbia, October 1991, pp. 49\u201359. ACM Press, New York (1991)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11812128_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:59Z","timestamp":1605644039000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11812128_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372134","9783540372141"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11812128_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}