{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T23:43:28Z","timestamp":1770421408966,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439500","type":"print"},{"value":"9783662439517","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_17","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"196-207","source":"Crossref","is-referenced-by-count":3,"title":["Coalgebraic Weak Bisimulation from Recursive Equations over Monads"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Goncharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2010.10.019","volume":"111","author":"L. Aceto","year":"2010","unstructured":"Aceto, L., Ingolfsdottir, A., Sack, J.: Resource bisimilarity and graded bisimilarity coincide. Information Processing Letters\u00a0111(2), 68\u201376 (2010)","journal-title":"Information Processing Letters"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-63166-6_14","volume-title":"Computer Aided Verification","author":"C. Baier","year":"1997","unstructured":"Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic processes. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.\u00a01254, pp. 119\u2013130. Springer, Heidelberg (1997)"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Bartels, F., Sokolova, A., de Vink, E.: A hierarchy of probabilistic system types. In: Coalgebraic Methods in Computer Science. ENTCS, vol.\u00a082. Elsevier (2003)","DOI":"10.1016\/S1571-0661(04)80632-7"},{"key":"17_CR4","unstructured":"Brengos, T.: Weak bisimulation for coalgebras over order enriched monads (2013), http:\/\/arxiv.org\/abs\/1310.3656"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/3-540-46691-6_31","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"F. Corradini","year":"1999","unstructured":"Corradini, F., De Nicola, R., Labella, A.: Graded modalities and resource bisimulation. In: Pandu Rangan, C., Raman, V., Ramanujam, R. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 381\u2013393. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(99)00035-3","volume":"221","author":"E. Vink de","year":"1999","unstructured":"de Vink, E., Rutten, J.: Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science\u00a0221(1-2), 271\u2013293 (1999)","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W.: Semirings and formal power series. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science, pp. 3\u201328. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_1"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Comp. Sci. (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"issue":"5","key":"17_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.entcs.2008.05.023","volume":"203","author":"B. Jacobs","year":"2008","unstructured":"Jacobs, B.: Coalgebraic trace semantics for combined possibilitistic and probabilistic systems. Electr. Notes Theor. Comput. Sci.\u00a0203(5), 131\u2013152 (2008)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"1","key":"17_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation\u00a094(1), 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Latella, D., Massink, M., de Vink, E.P.: Bisimulation of labeled state-to-function transition systems of stochastic process languages. In: Golas, U., Soboll, T. (eds.) Proc. ACCAT 2012. EPTCS, vol.\u00a093, pp. 23\u201343 (2012)","DOI":"10.4204\/EPTCS.93.2"},{"key":"17_CR12","unstructured":"Miculan, M., Peressotti, M.: Weak bisimulations for labelled transition systems weighted over semirings (2013), http:\/\/arxiv.org\/abs\/1310.4106"},{"key":"17_CR13","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall (1989)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/BFb0013462","volume-title":"Category Theory and Computer Science","author":"E. Moggi","year":"1991","unstructured":"Moggi, E.: A modular approach to denotational semantics. In: Curien, P.-L., Pitt, D.H., Pitts, A.M., Poign\u00e9, A., Rydeheard, D.E., Abramsky, S. (eds.) CTCS 1991. LNCS, vol.\u00a0530, pp. 138\u2013139. Springer, Heidelberg (1991)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45931-6_24","volume-title":"Foundations of Software Science and Computation Structures","author":"G. Plotkin","year":"2002","unstructured":"Plotkin, G., Power, J.: Notions of computation determine monads. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 342\u2013356. Springer, Heidelberg (2002)"},{"issue":"1","key":"17_CR16","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. Theoret. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR17","unstructured":"Segala, R.: Modelling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Massachusetts Institute of Technology (1995)"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/BFb0015027","volume-title":"CONCUR \u201994: Concurrency Theory","author":"R. Segala","year":"1994","unstructured":"Segala, R., Lynch, N.A.: Probabilistic simulations for probabilistic processes. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.\u00a0836, pp. 481\u2013496. Springer, Heidelberg (1994)"},{"key":"17_CR19","first-page":"93","volume":"19","author":"A. Sokolova","year":"2009","unstructured":"Sokolova, A., de Vink, E.P., Woracek, H.: Coalgebraic weak bisimulation for action-type systems. Sci. Ann. Comp. Sci.\u00a019, 93\u2013144 (2009)","journal-title":"Sci. Ann. Comp. Sci."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Staton, S.: Relating coalgebraic notions of bisimulation. Logical Methods in Computer Science\u00a07(1) (2011)","DOI":"10.2168\/LMCS-7(1:13)2011"},{"issue":"3","key":"17_CR21","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/233551.233556","volume":"43","author":"R.J. Glabbeek van","year":"1996","unstructured":"van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM\u00a043(3), 555\u2013600 (1996)","journal-title":"J. ACM"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1017\/S0960129505005074","volume":"16","author":"D. Varacca","year":"2006","unstructured":"Varacca, D., Winskel, G.: Distributing probability over non-determinism. Math. Struct. Comput. Sci.\u00a016, 87\u2013113 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"17_CR23","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages","author":"G. Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages. MIT Press, Cambridge (1993)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T17:48:29Z","timestamp":1597945709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}