{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:21:35Z","timestamp":1725909695220},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319670881"},{"type":"electronic","value":"9783319670898"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-67089-8_8","type":"book-chapter","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T12:47:26Z","timestamp":1503578846000},"page":"101-117","source":"Crossref","is-referenced-by-count":0,"title":["Topological Characterisation of Multi-buffer Simulation"],"prefix":"10.1007","author":[{"given":"Milka","family":"Hutagalung","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,25]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-78800-3_8","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"PA Abdulla","year":"2008","unstructured":"Abdulla, P.A., Bouajjani, A., Hol\u00edk, L., Kaati, L., Vojnar, T.: Computing simulations over tree automata. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 93\u2013108. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-78800-3_8"},{"issue":"1","key":"8_CR2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0890-5401(87)90040-X","volume":"73","author":"M Clerbout","year":"1987","unstructured":"Clerbout, M., Latteux, M.: Semi-commutations. Inf. Comput. 73(1), 59\u201374 (1987)","journal-title":"Inf. Comput."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/3-540-55179-4_25","volume-title":"Computer Aided Verification","author":"DL Dill","year":"1992","unstructured":"Dill, D.L., Hu, A.J., Wong-Toi, H.: Checking for language inclusion using simulation preorders. In: Larsen, K.G., Skou, A. (eds.) CAV 1991. LNCS, vol. 575, pp. 255\u2013265. Springer, Heidelberg (1992). doi:\n10.1007\/3-540-55179-4_25"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/3-540-48224-5_57","volume-title":"Automata, Languages and Programming","author":"K Etessami","year":"2001","unstructured":"Etessami, K., Wilke, T., Schuller, R.A.: Fair simulation relations, parity games, and state space reduction for B\u00fcchi automata. In: Orejas, F., Spirakis, P.G., Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 694\u2013707. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-48224-5_57"},{"issue":"7","key":"8_CR5","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1142\/S0129054112400606","volume":"23","author":"O Finkel","year":"2012","unstructured":"Finkel, O.: Three applications to rational relations of the high undecidability of the infinite post correspondence problem in a regular \n            $$\\omega $$\n          -language. Int. J. Found. Comput. Sci. 23(7), 1481\u20131498 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"8_CR6","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/j.tcs.2005.01.016","volume":"338","author":"C Fritz","year":"2005","unstructured":"Fritz, C., Wilke, T.: Simulation relations for alternating B\u00fcchi automata. Theor. Comput. Sci. 338(1), 275\u2013314 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR7","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1006\/inco.2001.3085","volume":"173","author":"TA Henzinger","year":"2002","unstructured":"Henzinger, T.A., Kupferman, O., Rajamani, S.K.: Fair simulation. Inf. Comput. 173(1), 64\u201381 (2002)","journal-title":"Inf. Comput."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Holtmann, M., Kaiser, L., Thomas, W.: Degrees of lookahead in regular infinite games. Log. Methods Comput. Sci. 8(3) (2012)","DOI":"10.2168\/LMCS-8(3:24)2012"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Hutagalung, M., Hundeshagen, N., Kuske, D., Lange, M., Lozes, \u00c9.: Multi-buffer simulations for trace language inclusion. In: GandALF 2016, pp. 213\u2013227 (2016)","DOI":"10.4204\/EPTCS.226.15"},{"volume-title":"Handbook of Formal Languages: Vol. 3: Beyond Words","year":"1977","key":"8_CR10","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages: Vol. 3: Beyond Words. Springer, New York (1977)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0023848","volume-title":"LATIN \u201992","author":"J Sakarovitch","year":"1992","unstructured":"Sakarovitch, J.: The \u201clast\u201d decision problem for rational trace languages. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 460\u2013473. Springer, Heidelberg (1992). doi:\n10.1007\/BFb0023848"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67089-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T12:51:52Z","timestamp":1503579112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67089-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319670881","9783319670898"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67089-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}