{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:21:48Z","timestamp":1725895308716},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642104510"},{"type":"electronic","value":"9783642104527"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10452-7_20","type":"book-chapter","created":{"date-parts":[[2009,11,4]],"date-time":"2009-11-04T08:37:26Z","timestamp":1257323846000},"page":"290-305","source":"Crossref","is-referenced-by-count":1,"title":["Defining Behaviours by Quasi-finality"],"prefix":"10.1007","author":[{"given":"Elisabete","family":"Freire","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Monteiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"WADT 2008","author":"L. Monteiro","year":"2009","unstructured":"Monteiro, L.: A coalgebraic characterization of behaviours in the linear time - branching time spectrum. In: Corradini, A., Montanari, U. (eds.) WADT 2008. LNCS. Springer, Heidelberg (2009)"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-044482830-9\/50019-9","volume-title":"Handbook of process algebra","author":"R. Glabbeek van","year":"2001","unstructured":"van Glabbeek, R.: The linear time\u2013branching time spectrum I: the semantics of concrete, sequential processes. In: Bergstra, J., Ponse, A., Smolka, S. (eds.) Handbook of process algebra, pp. 3\u201399. Elsevier, Amsterdam (2001)"},{"issue":"1-3","key":"20_CR3","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2004.12.009","volume":"338","author":"J. Worrell","year":"2005","unstructured":"Worrell, J.: On the final sequence of a finitary set functor. Theoretical Computer Science\u00a0338(1-3), 184\u2013199 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"03","key":"20_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1017\/S0960129505004755","volume":"15","author":"A. Kurz","year":"2005","unstructured":"Kurz, A., Pattinson, D.: Coalgebraic modal logic of finite rank. Mathematical Structures in Computer Science\u00a015(03), 453\u2013473 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"20_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(93)90076-6","volume":"114","author":"M. Barr","year":"1993","unstructured":"Barr, M.: Terminal coalgebras in well-founded set theory. Theoretical Computer Science\u00a0114(2), 299\u2013315 (1993)","journal-title":"Theoretical Computer Science"},{"key":"20_CR6","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"259","volume-title":"CTCS 1999, Conference on Category Theory and Computer Science","author":"J. Power","year":"1999","unstructured":"Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. In: Hofmann, M., Rosolini, G., Pavlovic, D. (eds.) CTCS 1999, Conference on Category Theory and Computer Science. Electronic Notes in Theoretical Computer Science, vol.\u00a029, pp. 259\u2013274. Elsevier, Amsterdam (1999)"},{"key":"20_CR7","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"167","volume-title":"Coalgebraic Methods in Computer Science","author":"B. Jacobs","year":"2004","unstructured":"Jacobs, B.: Trace semantics for coalgebras. In: Adamek, J., Milius, S. (eds.) Coalgebraic Methods in Computer Science. Electronic Notes in Theoretical Computer Science, vol.\u00a0106, pp. 167\u2013184. Elsevier, Amsterdam (2004)"},{"issue":"4:11","key":"20_CR8","first-page":"1","volume":"3","author":"I. Hasuo","year":"2007","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods in Computer Science\u00a03(4:11), 1\u201336 (2007)","journal-title":"Logical Methods in Computer Science"},{"issue":"1","key":"20_CR9","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. Theoretical Computer Science\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoretical Computer Science"},{"key":"20_CR10","series-title":"International Series in Computing Science","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. International Series in Computing Science. Prentice Hall International, Englewood Cliffs (1989)"},{"key":"20_CR11","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"73","volume-title":"Coalgebraic Methods in Computer Science (CMCS 1998)","author":"L. Monteiro","year":"1998","unstructured":"Monteiro, L.: Semantic domains based on sets with families of equivalences. In: Jacobs, B., Moss, L., Reichel, H., Rutten, J. (eds.) Coalgebraic Methods in Computer Science (CMCS 1998). Electronic Notes in Theoretical Computer Science, vol.\u00a011, pp. 73\u2013106. Elsevier, Amsterdam (1998)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00240-7","volume":"294","author":"J. Ad\u00e1mek","year":"2003","unstructured":"Ad\u00e1mek, J.: On final coalgebras of continuous functors. Theoretical Computer Science\u00a0294, 3\u201329 (2003)","journal-title":"Theoretical Computer Science"},{"key":"20_CR13","first-page":"280","volume-title":"Proc. 12th LICS Conf.","author":"D. Turi","year":"1997","unstructured":"Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proc. 12th LICS Conf., pp. 280\u2013291. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1017\/S096012950000147X","volume":"15","author":"J. Rutten","year":"1992","unstructured":"Rutten, J.: Processes as terms: non-well-founded models for bisimulation. Mathematical Structures in Computer Science\u00a015, 257\u2013275 (1992)","journal-title":"Mathematical Structures in Computer Science"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1007\/3-540-58043-3_28","volume-title":"A Decade of Concurrency","author":"J. Rutten","year":"1994","unstructured":"Rutten, J., Turi, D.: Initial algebra and final coalgebra semantics for concurrency. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1993. LNCS, vol.\u00a0803, pp. 530\u2013582. Springer, Heidelberg (1994)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(01)00019-6","volume":"280","author":"U. Wolter","year":"2002","unstructured":"Wolter, U.: CSP, partial automata, and coalgebras. Theoretical Computer Science\u00a0280, 3\u201334 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Formal Methods: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10452-7_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:31:45Z","timestamp":1619782305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10452-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642104510","9783642104527"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10452-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}