{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T04:55:29Z","timestamp":1784350529846,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540373766","type":"print"},{"value":"9783540373773","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_27","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:59:29Z","timestamp":1154548769000},"page":"406-420","source":"Crossref","is-referenced-by-count":17,"title":["Generic Forward and Backward Simulations"],"prefix":"10.1007","author":[{"given":"Ichiro","family":"Hasuo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Cheung, L.: Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Radboud Univ. Nijmegen (2006)"},{"issue":"2","key":"27_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1006\/inco.1996.0058","volume":"127","author":"M. Fiore","year":"1996","unstructured":"Fiore, M.: A coinduction principle for recursive data types based on bisimulation. Inf. & Comp.\u00a0127(2), 186\u2013198 (1996)","journal-title":"Inf. & Comp."},{"key":"27_CR3","volume-title":"IOA: a language for specifying, programming, and validating distributed systems","author":"S. Garland","year":"1997","unstructured":"Garland, S., Lynch, N., Vaziri, M.: IOA: a language for specifying, programming, and validating distributed systems. MIT Laboratory for Computer Science, Cambridge (1997)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/11548133_14","volume-title":"Algebra and Coalgebra in Computer Science","author":"I. Hasuo","year":"2005","unstructured":"Hasuo, I., Jacobs, B.: Context-Free Languages via Coalgebraic Trace Semantics. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 213\u2013231. Springer, Heidelberg (2005)"},{"key":"27_CR5","series-title":"Elect. Notes in Theor. Comp. Sci","volume-title":"Coalgebraic Methods in Computer Science (CMCS 2006)","author":"I. Hasuo","year":"2006","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace theory. In: Coalgebraic Methods in Computer Science (CMCS 2006). Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam (2006)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Hasuo, I.: Generic forward and backward simulations. Technical report, Research Center for Verification and Semantics, National Institute of Advanced Industrial Science and Technology (AIST), Japan (2006), http:\/\/www.cs.ru.nl\/ichiro\/papers\/","DOI":"10.1007\/11817949_27"},{"issue":"1-2","key":"27_CR7","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2004.07.022","volume":"327","author":"J. Hughes","year":"2004","unstructured":"Hughes, J., Jacobs, B.: Simulations in coalgebra. Theor. Comp. Sci.\u00a0327(1-2), 71\u2013108 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"27_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"CONCUR \u201990","author":"C. Jou","year":"1990","unstructured":"Jou, C., Smolka, S.: Equivalences, congruences and complete axiomatizations for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 367\u2013383. Springer, Heidelberg (1990)"},{"key":"27_CR9","unstructured":"Kawabe, Y., Mano, K., Sakurada, H., Tsukada, Y.: Backward simulations for anonymity. In: International Workshop on Issues in the Theory of Security (WITS 2006) (2006)"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s002360050171","volume":"36","author":"Y. Kinoshita","year":"2000","unstructured":"Kinoshita, Y., Power, J.: Data refinement and algebraic structure. Acta Informatica\u00a036, 693\u2013719 (2000)","journal-title":"Acta Informatica"},{"key":"27_CR11","unstructured":"Klarlund, N., Schneider, F.: Verifying safety properties using infinite-state automata. Technical Report 89-1039, Department of Computer Science, Cornell University, Ithaca, New York (1989)"},{"issue":"2","key":"27_CR12","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1995.1134","volume":"121","author":"N. Lynch","year":"1995","unstructured":"Lynch, N., Vaandrager, F.: Forward and backward simulations. I.\u00a0Untimed systems. Inf. & Comp.\u00a0121(2), 214\u2013233 (1995)","journal-title":"Inf. & Comp."},{"key":"27_CR13","series-title":"Elect. Notes in Theor. Comp. Sci","volume-title":"Category Theory and Computer Science","author":"J. Power","year":"1999","unstructured":"Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. In: Category Theory and Computer Science. Elect. Notes in Theor. Comp. Sci, vol.\u00a029. Elsevier, Amsterdam (1999)"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J. Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comp. Sci.\u00a0249, 3\u201380 (2000)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"27_CR15","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journ. Comput.\u00a02(2), 250\u2013273 (1995)","journal-title":"Nordic Journ. Comput."},{"key":"27_CR16","unstructured":"Sokolova, A.: Coalgebraic Analysis of Probabilistic Systems. PhD thesis, TU Eindhoven (2005)"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R. Glabbeek van","year":"1995","unstructured":"van Glabbeek, R., Smolka, S., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. Inf. & Comp.\u00a0121, 59\u201380 (1995)","journal-title":"Inf. & Comp."},{"issue":"1\u20132","key":"27_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00056-X","volume":"176","author":"S.H. Wu","year":"1997","unstructured":"Wu, S.H., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic I\/O automata. Theor. Comp. Sci.\u00a0176(1\u20132), 1\u201338 (1997)","journal-title":"Theor. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:49Z","timestamp":1605644149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11817949_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}