{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:00:14Z","timestamp":1725746414520},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402050"},{"type":"electronic","value":"9783642402067"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40206-7_20","type":"book-chapter","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T03:29:41Z","timestamp":1377574181000},"page":"267-281","source":"Crossref","is-referenced-by-count":4,"title":["A Coalgebraic View of \u03b5-Transitions"],"prefix":"10.1007","author":[{"given":"Alexandra","family":"Silva","sequence":"first","affiliation":[]},{"given":"Bram","family":"Westerbaan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.ic.2011.12.002","volume":"211","author":"F. Bonchi","year":"2012","unstructured":"Bonchi, F., Bonsangue, M., Boreale, M., Rutten, J., Silva, A.: A coalgebraic perspective on linear weighted automata. Inf. Comput.\u00a0211, 77\u2013105 (2012)","journal-title":"Inf. Comput."},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-29485-3_2","volume-title":"Logic and Program Semantics","author":"F. Bonchi","year":"2012","unstructured":"Bonchi, F., Bonsangue, M., Rutten, J., Silva, A.: Brzozowski\u2019s algorithm (co)algebraically. In: Constable, R.L., Silva, A. (eds.) Logic and Program Semantics. LNCS, vol.\u00a07230, pp. 12\u201323. Springer, Heidelberg (2012)"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Pous, D.: Checking NFA equivalence with bisimulations up to congruence. In: POPL, pp. 457\u2013468. ACM (2013)","DOI":"10.1145\/2480359.2429124"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-642-33475-7_7","volume-title":"Theoretical Computer Science","author":"T. Brengos","year":"2012","unstructured":"Brengos, T.: Weak bisimulations for coalgebras over ordered functors. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds.) TCS 2012. LNCS, vol.\u00a07604, pp. 87\u2013103. Springer, Heidelberg (2012)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Droste, M., Kuich, W., Vogler, W.: Handbook of Weighted Automata. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5"},{"issue":"1","key":"20_CR6","first-page":"185","volume":"44","author":"H. Peter Gumm","year":"2001","unstructured":"Peter Gumm, H., Schr\u00f6der, T.: Monoid-labeled transition systems. ENTCS\u00a044(1), 185\u2013204 (2001)","journal-title":"ENTCS"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic Forward and Backward Simulations. In: Proceedings of JSSST Annual Meeting (2006) (Partly in Japanese)","DOI":"10.1007\/11817949_27"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic Trace Semantics via Coinduction. Logical Methods in Computer Science\u00a03(4) (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"issue":"2","key":"20_CR9","first-page":"125","volume":"264","author":"B. Jacobs","year":"2010","unstructured":"Jacobs, B.: From coalgebraic to monoidal traces. ENTCS\u00a0264(2), 125\u2013140 (2010)","journal-title":"ENTCS"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-32784-1_7","volume-title":"Coalgebraic Methods in Computer Science","author":"B. Jacobs","year":"2012","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. In: Pattinson, D., Schr\u00f6der, L. (eds.) CMCS 2012. LNCS, vol.\u00a07399, pp. 109\u2013129. Springer, Heidelberg (2012)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/978-3-642-32940-1_29","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"H. Kerstan","year":"2012","unstructured":"Kerstan, H., K\u00f6nig, B.: Coalgebraic trace semantics for probabilistic transition systems based on measure theory. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 410\u2013424. Springer, Heidelberg (2012)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-31606-7_31","volume-title":"Implementation and Application of Automata","author":"S. Lombardy","year":"2012","unstructured":"Lombardy, S., Sakarovitch, J.: The Removal of Weighted \u03b5-Transitions. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol.\u00a07381, pp. 345\u2013352. Springer, Heidelberg (2012)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Milius, S.: On Iteratable Endofunctors. In: CTCS. ENTCS, vol.\u00a069, pp. 287\u2013304. Elsevier (2002)","DOI":"10.1016\/S1571-0661(04)80570-X"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/3-540-44674-5_19","volume-title":"Implementation and Application of Automata","author":"M. Mohri","year":"2001","unstructured":"Mohri, M.: Generic \u03b5-removal algorithm for weighted automata. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol.\u00a02088, pp. 230\u2013242. Springer, Heidelberg (2001)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BFb0055624","volume-title":"CONCUR \u201998 Concurrency Theory","author":"J. Rutten","year":"1998","unstructured":"Rutten, J.: Automata and coinduction (an exercise in coalgebra). In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.\u00a01466, pp. 194\u2013218. Springer, Heidelberg (1998)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: An introduction to bisimulation and coinduction. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511777110"},{"key":"20_CR17","unstructured":"Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing the powerset construction, coalgebraically. In: FSTTCS. LIPIcs, vol.\u00a08, pp. 272\u2013283 (2010)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing determinization from automata to coalgebras. LMCS\u00a09(1) (2013)","DOI":"10.2168\/LMCS-9(1:9)2013"},{"key":"20_CR19","unstructured":"Silva, A., Westerbaan, B.: A Coalgebraic View of \u03b5-Transitions. Extended abstract, with proofs, http:\/\/alexandrasilva.org\/files\/epsilon-extended.pdf"},{"key":"20_CR20","first-page":"93","volume":"19","author":"A. Sokolova","year":"2009","unstructured":"Sokolova, A., de Vink, E., Woracek, H.: Coalgebraic weak bisimulation for action-type systems. Sci. Ann. Comp. Sci.\u00a019, 93\u2013144 (2009)","journal-title":"Sci. Ann. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40206-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T03:33:24Z","timestamp":1688441604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40206-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402050","9783642402067"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40206-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}