{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:17:31Z","timestamp":1773717451612,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540705437","type":"print"},{"value":"9783540705451","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70545-1_49","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"517-529","source":"Crossref","is-referenced-by-count":23,"title":["Correcting a Space-Efficient Simulation Algorithm"],"prefix":"10.1007","author":[{"given":"Rob","family":"van Glabbeek","sequence":"first","affiliation":[]},{"given":"Bas","family":"Ploeger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"49_CR1","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1145\/200836.200876","volume":"42","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Istrail, S., Meyer, A.R.: Bisimulation can\u2019t be traced. Journal of the ACM\u00a042(1), 232\u2013268 (1995)","journal-title":"Journal of the ACM"},{"issue":"3","key":"49_CR2","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0167-6423(95)00003-B","volume":"24","author":"B. Bloom","year":"1995","unstructured":"Bloom, B., Paige, R.: Transformational design and implementation of a new efficient solution to the ready simulation problem. Science of Computer Programming\u00a024(3), 189\u2013220 (1995)","journal-title":"Science of Computer Programming"},{"issue":"2","key":"49_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/635499.635502","volume":"4","author":"D. Bustan","year":"2003","unstructured":"Bustan, D., Grumberg, O.: Simulation-based minimization. ACM Transactions on Computational Logic\u00a04(2), 181\u2013206 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BFb0023737","volume-title":"Computer-Aided Verification","author":"C. Courcoubetis","year":"1991","unstructured":"Courcoubetis, C., Vardi, M.Y., Wolper, P., Yannakakis, M.: Memory efficient algorithms for the verification of temporal properties. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol.\u00a0531, pp. 233\u2013242. Springer, Heidelberg (1991)"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/3-540-56922-7_39","volume-title":"Computer Aided Verification","author":"D. Dams","year":"1993","unstructured":"Dams, D., Grumberg, O., Gerth, R.: Generation of reduced models for checking fragments of CTL. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 479\u2013490. Springer, Heidelberg (1993)"},{"issue":"1","key":"49_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"Emerson, E.A., Halpern, J.Y.: \u201dSometimes\u201d and \u201dNot Never\u201d revisited: On branching versus linear time temporal logic. Journal of the ACM\u00a033(1), 151\u2013178 (1986)","journal-title":"Journal of the ACM"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/11537328_7","volume-title":"Model Checking Software","author":"S. Evangelista","year":"2005","unstructured":"Evangelista, S., Pradat-Peyre, J.-F.: Memory efficient state space storage in explicit software model checking. In: Godefroid, P. (ed.) SPIN 2005. LNCS, vol.\u00a03639, pp. 43\u201357. Springer, Heidelberg (2005)"},{"issue":"1","key":"49_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1023\/A:1027328830731","volume":"31","author":"R. Gentilini","year":"2003","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: Coarsest partition problems. Journal of Automated Reasoning\u00a031(1), 73\u2013103 (2003)","journal-title":"Journal of Automated Reasoning"},{"key":"49_CR9","unstructured":"Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation: Coarsest partition problems. RR 12-2003, Dep. of Computer Science, University of Udine, Italy (2003)"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"van Glabbeek, R.J., Ploeger, B.: Correcting a space-efficient simulation algorithm. CS-Report 08-06, Eindhoven University of Technology (2008)","DOI":"10.1007\/978-3-540-70545-1_49"},{"issue":"2","key":"49_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"Groote, J.F., Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Information and Computation\u00a0100(2), 202\u2013260 (1992)","journal-title":"Information and Computation"},{"key":"49_CR12","first-page":"453","volume-title":"36th Annual Symposium on Foundations of Computer Science (FOCS 1995)","author":"M.R. Henzinger","year":"1995","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 453\u2013462. IEEE Computer Society Press, Los Alamitos (1995)"},{"issue":"2","key":"49_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1002\/spe.4380180203","volume":"18","author":"G.J. Holzmann","year":"1988","unstructured":"Holzmann, G.J.: An improved protocol reachability analysis technique. Software Practice and Experience\u00a018(2), 137\u2013161 (1988)","journal-title":"Software Practice and Experience"},{"key":"49_CR14","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.: Results on the propositional \u03bc-calculus. Theoretical Computer Science\u00a027, 333\u2013354 (1983)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"49_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S1471068406002651","volume":"6","author":"A. Kucera","year":"2006","unstructured":"Kucera, A., Jancar, P.: Equivalence-checking on infinite-state systems: Techniques and results. Theory and Practice of Logic Programming\u00a06(3), 227\u2013264 (2006)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1","key":"49_CR16","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01384313","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design\u00a06(1), 11\u201344 (1995)","journal-title":"Formal Methods in System Design"},{"key":"49_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D.M.R. Park","year":"1981","unstructured":"Park, D.M.R.: Concurrency and automata on infinite sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"49_CR18","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1109\/LICS.2007.8","volume-title":"Proc.\u00a022nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007)","author":"F. Ranzato","year":"2007","unstructured":"Ranzato, F., Tapparo, F.: A new efficient simulation equivalence algorithm. In: Proc.\u00a022nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp. 171\u2013180. IEEE Computer Society Press, Los Alamitos (2007)"},{"key":"49_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/800125.804029","volume-title":"Proc. 5th Annual ACM Symposium on Theory of Computing (STOC 1973)","author":"L.J. Stockmeyer","year":"1973","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Proc. 5th Annual ACM Symposium on Theory of Computing (STOC 1973), pp. 1\u20139. ACM, New York (1973)"},{"key":"49_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-45319-9_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. Tan","year":"2001","unstructured":"Tan, L., Cleaveland, R.: Simulation revisited. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol.\u00a02031, pp. 480\u2013495. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70545-1_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T04:00:19Z","timestamp":1557720019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70545-1_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705437","9783540705451"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70545-1_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}