{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:48:29Z","timestamp":1725468509673},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540648277"},{"type":"electronic","value":"9783540685326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055763","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T13:36:31Z","timestamp":1155821791000},"page":"142-151","source":"Crossref","is-referenced-by-count":20,"title":["The joys of bisimulation"],"prefix":"10.1007","author":[{"given":"Colin","family":"Stirling","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/174130.174141","volume":"40","author":"J. Baeten","year":"1993","unstructured":"Baeten, J., Bergstra, J., and Klop, J. (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of Association of Computing Machinery, 40, 653\u2013682.","journal-title":"Journal of Association of Computing Machinery"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"van Benthem, J. (1984). Correspondence theory. In Handbook of Philosophical Logic, Vol. II, ed. Gabbay, D. and Guenthner, F., 167\u2013248, Reidel.","DOI":"10.1007\/978-94-009-6259-0_4"},{"key":"10_CR3","unstructured":"van Benthem, J. (1996). Exploring Logical Dynamics. CSLI Publications."},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/3-540-61604-7_59","volume":"1119","author":"O. Burkart","year":"1996","unstructured":"Burkart, O., Caucal, D., and Steffen, B. (1996). Bisimulation collapse and the process taxonomy. Lecture Notes in Computer Science, 1119, 247\u2013262.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0304-3975(92)90278-N","volume":"106","author":"D. Caucal","year":"1992","unstructured":"Caucal, D. (1992). On the regular structure of prefix rewriting. Theoretical Computer Science, 106, 61\u201386.","journal-title":"Theoretical Computer Science"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-61440-0_128","volume":"1099","author":"D. Caucal","year":"1996","unstructured":"Caucal, D. (1996). On infinite transition graphs having a decidable monadic theory. Lecture Notes in Computer Science, 1099, 194\u2013205.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/3-540-53832-1_51","volume":"484","author":"D. Caucal","year":"1990","unstructured":"Caucal, D., and Monfort, R. (1990). On the transition graphs of automata and grammars. Lecture Notes in Computer Science, 484, 311\u2013337.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/3-540-57208-2_11","volume":"715","author":"S. Christensen","year":"1993","unstructured":"Christensen, S., Hirshfeld, Y., and Moller, F. (1993). Bisimulation is decidable for basic parallel processes. Lecture Notes in Computer Science, 715, 143\u2013157.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1995.1129","volume":"121","author":"S. Christensen","year":"1995","unstructured":"Christensen, S., H\u00fcttel, H., and Stirling, C. (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121, 143\u2013148.","journal-title":"Information and Computation"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Dawar, A. (1997). A restricted second-order logic for finite structures, To appear in Information and Computation.","DOI":"10.1006\/inco.1998.2703"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Emerson, E., and Jutla, C. (1988). The complexity of tree automata and logics of programs. Extended version from FOCS '88.","DOI":"10.1109\/SFCS.1988.21949"},{"key":"10_CR12","unstructured":"Goldblatt, R. (1995). Saturation and the Hennessy-Milner property. In Modal Logic and Process Algebra, ed. Ponse, A., De Rijke, M. and Venema, Y. CSLI Publications, 107\u2013130."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/inco.1994.1101","volume":"115","author":"J. Groote","year":"1994","unstructured":"Groote, J., and H\u00fcttel, H. (1994). Undecidable equivalences for basic process algebra. Information and Computation, 115, 354\u2013371.","journal-title":"Information and Computation"},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M. and Milner, R. (1985). Algebraic laws for nondeterminism and concurrency. Journal of Association of Computer Machinery, 32, 137\u2013162.","journal-title":"Journal of Association of Computer Machinery"},{"key":"10_CR15","unstructured":"Hollenberg, M. (1995). Hennessy-Milner classes and process calculi. In Modal Logic and Process Algebra, ed. Ponse, A., De Rijke, M. and Venema, Y. CSLI Publications, 187\u2013216."},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"H\u00fcttel, H. (1994). Undecidable equivalences for basic parallel processes. Lecture Notes in Computer Science, 789.","DOI":"10.1007\/3-540-57887-0_110"},{"key":"10_CR17","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/3-540-57785-8_173","volume":"775","author":"P. Jan\u010dar","year":"1994","unstructured":"Jan\u010dar, P. (1994). Decidability questions for bisimilarity of Petri nets and some related problems. Lecture Notes in Computer Science, 775, 581\u2013594.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","volume":"1119","author":"D. Janin","year":"1996","unstructured":"Janin, D. and Walukiewicz, I (1996). On the expressive completeness of the prepositional mu-calculus with respect to the monadic second order logic. Lecture Notes in Computer Science, 1119, 263\u2013277.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D. (1983). Results on the propositional mu-calculus. Theoretical Computer Science, 27, 333\u2013354.","journal-title":"Theoretical Computer Science"},{"key":"10_CR20","unstructured":"Milner, R. (1989). Communication and Concurrency. Prentice Hall."},{"key":"10_CR21","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/3-540-61604-7_56","volume":"1119","author":"F. Moller","year":"1996","unstructured":"Moller, F. (1996). Infinite results. Lecture Notes in Computer Science, 1119, 195\u2013216.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR22","unstructured":"Otto, M. (1997). Bisimulation-invariant ptime and higher-dimensional \u03bc-calculus. Preliminary report RWTH Aachen."},{"key":"10_CR23","first-page":"561","volume":"154","author":"D. Park","year":"1981","unstructured":"Park, D. (1981). Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 154, 561\u2013572.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR24","unstructured":"Rosen, E. (1995). Modal logic over finite structures. Tech Report, University of Amsterdam."},{"key":"10_CR25","unstructured":"Rutten, J. (1995). A calculus of transition systems (towards universal coalgebra). In Modal Logic and Process Algebra, ed. Ponse, A., De Rijke, M. and Venema, Y. CSLI Publications, 187\u2013216."},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/3-540-63165-8_221","volume":"1256","author":"G. S\u00e9nizergues","year":"1997","unstructured":"S\u00e9nizergues, G. (1997). The equivalence problem for deterministic pushdown automata is decidable. Lecture Notes in Computer Science, 1256, 671\u2013681.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR27","unstructured":"S\u00e9nizergues, G. (1998). \u03b3(A) \u223c \u03b3(B)? Draft paper."},{"key":"10_CR28","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-60915-6_5","volume":"1043","author":"C. Stirling","year":"1996","unstructured":"Stirling, C. (1996). Modal and temporal logics for processes. Lecture Notes in Computer Science, 1043, 149\u2013237.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR29","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/3-540-61042-1_51","volume":"1055","author":"C. Stirling","year":"1996","unstructured":"Stirling, C. (1996). Games and modal mu-calculus. Lecture Notes in Computer Science, 1055, 298\u2013312.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Thomas, W. (1993). On the Ehrenfeucht-Fra\u00cfss\u00e9 game in theoretical computer science. Lecture Notes in Computer Science, 668.","DOI":"10.1007\/3-540-56610-4_89"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1998"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T14:44:34Z","timestamp":1555771474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055763"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648277","9783540685326"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0055763","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}