{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T16:49:20Z","timestamp":1761929360443},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770497"},{"type":"electronic","value":"9783540770503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_17","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T08:39:22Z","timestamp":1196066362000},"page":"204-215","source":"Crossref","is-referenced-by-count":10,"title":["An Incremental Bisimulation Algorithm"],"prefix":"10.1007","author":[{"given":"Diptikalyan","family":"Saha","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1145\/503272.503296","volume-title":"ACM POPL","author":"U.A. Acar","year":"2002","unstructured":"Acar, U.A., Blelloch, G.E., Harper, R.: Adaptive functional programming. In: ACM POPL, New York, NY, USA, vol.\u00a037, pp. 247\u2013259. ACM Press, New York (2002)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-45635-X_19","volume-title":"Logic Programming","author":"S. Basu","year":"2001","unstructured":"Basu, S., Mukund, M., Ramakrishnan, C.R., Ramakrishnan, I.V., Verma, R.M.: Local and symbolic bisimulation using tabled constraint logic programming. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 166\u2013180. Springer, Heidelberg (2001)"},{"key":"17_CR3","unstructured":"Benthem, J.V.: Modal Correspondence Theory. PhD thesis, University van Amsterdam (1976)"},{"key":"17_CR4","unstructured":"CADP. Caesar\/aldebran developement package c1.112, Available at (2001), http:\/\/www.inrialpes.fr\/vasy\/cadp.html"},{"key":"17_CR5","unstructured":"CWB-NC. The concurrency workbench of new century v1.1.1, Available at (2001), http:\/\/www.cs.sunysb.edu\/~cwb"},{"issue":"1-3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A. Dovier","year":"2004","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theor. Comput. Sci.\u00a0311(1-3), 221\u2013256 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR7","unstructured":"Dovier, A., Piazza, C., Policriti, A., Ugel, N.: A fast bisimulation algorithm: Test, http:\/\/www.dimi.uniud.it\/~piazza\/bisim\/web.ps"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, A., Mumick, I.S., Subrahmanian, V.S.: Maintaining views incrementally. In: ACM SIGMOD, pp. 157\u2013166 (1993)","DOI":"10.1145\/170035.170066"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"Hennessy, M., Lin, H.: Symbolic bisimulations. Theor. Comput. Sci.\u00a0138(2), 353\u2013389 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/B978-0-12-417750-5.50022-1","volume-title":"Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. In: Theory of Machines and Computations, pp. 189\u2013196. Academic Press, London (1971)"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/117009.117012","volume":"13","author":"S.E. Hudson","year":"1991","unstructured":"Hudson, S.E.: Incremental attribute evaluation: a flexible algorithm for lazy update. ACM Transaction of Programming Languages and Systems\u00a013(3), 315\u2013341 (1991)","journal-title":"ACM Transaction of Programming Languages and Systems"},{"key":"17_CR12","first-page":"228","volume-title":"PODS","author":"P.C. Kanellakis","year":"1983","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. In: PODS, pp. 228\u2013240. ACM Press, New York (1983)"},{"issue":"1","key":"17_CR13","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. Inf. Comput.\u00a086(1), 43\u201368 (1990)","journal-title":"Inf. Comput."},{"key":"17_CR14","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1982","unstructured":"Milner, R.: A Calculus of Communicating Systems, Secaucus, NJ, USA. Springer, Heidelberg (1982)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Milner, R.: Operational and algebraic semantics of concurrent processes, 1201\u20131242 (1990)","DOI":"10.1016\/B978-0-444-88074-1.50024-X"},{"issue":"6","key":"17_CR16","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput.\u00a016(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(85)90159-8","volume":"40","author":"R. Paige","year":"1985","unstructured":"Paige, R., Tarjan, R.E., Bonic, R.: A linear time solution to the single function coarsest partition problem. Theor. Comput. Sci.\u00a040, 67\u201384 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-24599-5_27","volume-title":"Logic Programming","author":"D. Saha","year":"2003","unstructured":"Saha, D., Ramakrishnan, C.R.: Incremental evaluation of tabled logic programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 389\u2013406. Springer, Heidelberg (2003)"},{"key":"17_CR19","volume-title":"ACM Conference on Principles and Practice of Declarative Programming","author":"D. Saha","year":"2005","unstructured":"Saha, D., Ramakrishnan, C.R.: Incremental and demand-driven points-to analysis using logic programming. In: ACM Conference on Principles and Practice of Declarative Programming, ACM Press, New York (2005)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11603023_15","volume-title":"Practical Aspects of Declarative Languages","author":"D. Saha","year":"2005","unstructured":"Saha, D., Ramakrishnan, C.R.: Incremental evaluation of tabled prolog: Beyond pure logic programs. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol.\u00a03819, pp. 215\u2013229. Springer, Heidelberg (2005)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/11799573_7","volume-title":"Logic Programming","author":"D. Saha","year":"2006","unstructured":"Saha, D., Ramakrishnan, C.R.: A local algorithm for incremental evaluation of logic programs. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 56\u201371. Springer, Heidelberg (2006)"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0898-1221(81)90008-0","volume":"7","author":"M. Sharir","year":"1981","unstructured":"Sharir, M.: A strong connectivity algorithm and its application in data flow analysis. Computer and Mathematics with Applications\u00a07(1), 67\u201372 (1981)","journal-title":"Computer and Mathematics with Applications"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-58179-0_67","volume-title":"Computer Aided Verification","author":"O.V. Sokolsky","year":"1994","unstructured":"Sokolsky, O.V., Smolka, S.A.: Incremental model checking in the modal mu-calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol.\u00a0818, pp. 351\u2013363. Springer, Heidelberg (1994)"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Swamy, G.: Incremental Methods for Formal Verification and Logic Synthesis. PhD thesis, University of California at Berkeley (1996)","DOI":"10.2139\/ssrn.3702088"},{"key":"17_CR25","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1145\/1007568.1007624","volume-title":"SIGMOD","author":"K. Yi","year":"2004","unstructured":"Yi, K., He, H., Stanoi, I., Yang, J.: Incremental maintenance of XML structural indexes. In: SIGMOD, pp. 491\u2013502. ACM Press, New York (2004)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T22:48:32Z","timestamp":1684104512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}