{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:23Z","timestamp":1761597023038},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_34","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"383-393","source":"Crossref","is-referenced-by-count":19,"title":["State Space Reduction Using Partial \u03c4-Confluence"],"prefix":"10.1007","author":[{"given":"Jan Friso","family":"Groote","sequence":"first","affiliation":[]},{"given":"Jaco","family":"van de Pol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"34_CR1","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman. Data structures and algorithms. Addison-Wesley. 1983."},{"issue":"4","key":"34_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1093\/comjnl\/37.4.289","volume":"37","author":"M.A. Bezem","year":"1994","unstructured":"M.A. Bezem and J.F. Groote. A correctness proof of a one bit sliding window protocol in \u03bcCRL. The Computer Journal, 37(4): 289\u2013307, 1994.","journal-title":"The Computer Journal"},{"key":"34_CR3","unstructured":"M. Cherif and H. Garavel and H. Hermanns. The bcg_min user manual, version 1.1. http:\/\/www.inrialpes.fr\/vasy\/cadp\/man\/bcg_min.html , 1999."},{"key":"34_CR4","unstructured":"D. Dill, C.N. Ip and U. Stern. Murphi description language and verifier. http:\/\/sprout.stanford.edu\/dill\/murphi.html , 1992-2000."},{"key":"34_CR5","unstructured":"H. Garavel and R. Mateescu. The Caesar\/Aldebaran development package. http:\/\/www.inrialpes.fr\/vasy\/cadp\/ , 1996-2000."},{"issue":"3","key":"34_CR6","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"R.J. van Glabbeek and W.P. Weijland. Branching time and abstraction in bisimulation semantics. In Journal of the ACM, 43(3):555\u2013600, 1996.","journal-title":"Journal of the ACM"},{"issue":"2","key":"34_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1006\/inco.1994.1035","volume":"110","author":"P. Godefroid","year":"1994","unstructured":"P. Godefroid and P. Wolper. A partial approach to model checking. Information and Computation, 110(2):305\u2013326, 1994.","journal-title":"Information and Computation"},{"key":"34_CR8","unstructured":"J.F. Groote and B. Lisser. The CRL toolset. http:\/\/www.cwi.nl\/~mcrl , 1999\u20132000."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"J.F. Groote and J.C. van de Pol. State space reduction using partial \u03c4-confluence. Technical Report CWI-SEN-R0008, March 2000. Available via http:\/\/www.cwi.nl\/_vdpol\/papers\/ .","DOI":"10.1007\/3-540-44612-5_34"},{"issue":"1-2","key":"34_CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0304-3975(96)80702-X","volume":"170","author":"J.F. Groote","year":"1996","unstructured":"J.F. Groote and M.P.A. Sellink. Confluence for process verification. In Theoretical Computer Science B, 170(1-2):47\u201381, 1996.","journal-title":"Theoretical Computer Science B"},{"key":"34_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1007\/BFb0032063","volume-title":"Proc. 17th ICALP","author":"J.F. Groote","year":"1990","unstructured":"J.F. Groote and F.W. Vaandrager. An efficient algorithm for branching bisimulation and stuttering equivalence. In Proc. 17th ICALP, LNCS 443, 626\u2013638. Springer-Verlag, 1990."},{"issue":"1","key":"34_CR12","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":"34_CR13","doi-asserted-by":"crossref","unstructured":"N. Kobayashi, B.C. Pierce, and D.N. Turner. Linearity and the \u03c4-calculus. In: Proceedings of the 23rd POPL, pages 358\u2013371. ACM press, January1996.","DOI":"10.1145\/237721.237804"},{"key":"34_CR14","series-title":"Lect Notes Comput Sci","first-page":"217","volume-title":"Proceedings of TAPSOFT\u201995","author":"X. Liu","year":"1995","unstructured":"X. Liu and D. Walker. Confluence of processes and systems of objects. In Proceedings of TAPSOFT\u201995, pages 217\u2013231, LNCS 915, 1995."},{"key":"34_CR15","volume-title":"Technical Report SEN-R9706","author":"S.P. Luttik","year":"1997","unstructured":"S.P. Luttik. Description and formal specification of the link layer of P1394. Technical Report SEN-R9706, CWI, Amsterdam, 1997."},{"key":"34_CR16","unstructured":"R. Milner. Communication and Concurrency. Prentice Hall International. 1989."},{"key":"34_CR17","first-page":"77","volume-title":"Proceedings of FMICS\u201997","author":"U. Nestmann","year":"1997","unstructured":"U. Nestmann and M. Steffen. Typing confluence. In: Proceedings of FMICS\u201997, pages 77\u2013101. CNR Pisa, 1997."},{"issue":"6","key":"34_CR18","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"34_CR19","series-title":"Lect Notes Comput Sci","volume-title":"24th Int. Coll. on Automata, Languages and Programming","author":"A. Philippou","year":"1997","unstructured":"A. Philippou and D. Walker. On confluence in the pi-calculus. 24th Int. Coll. on Automata, Languages and Programming, LNCS1256, Springer-Verlag, 1997."},{"issue":"1","key":"34_CR20","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/s100090050018","volume":"2","author":"M. Sighireanu","year":"1998","unstructured":"M. Sighireanu and R. Mateescu. Verification of the link layer protocol of the IEEE-1394 serial bus (firewire): an experiment with E-LOTOS. In Journal on Software Tools for Technology Transfer (STTT), 2(1):68\u201388, 1998.","journal-title":"Journal on Software Tools for Technology Transfer (STTT)"},{"key":"34_CR21","series-title":"Lect Notes Comput Sci","first-page":"25","volume-title":"Proc. of Computer Aided Verification","author":"A. Valmari","year":"1990","unstructured":"A. Valmari. A stubborn attack on state explosion. In Proc. of Computer Aided Verification, LNCS 531, pages 25\u201342, Springer-Verlag, 1990."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T18:41:23Z","timestamp":1556390483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}