{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:25Z","timestamp":1725491605539},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752905"},{"type":"electronic","value":"9783540752929"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75292-9_16","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T06:43:07Z","timestamp":1189492987000},"page":"231-245","source":"Crossref","is-referenced-by-count":1,"title":["Reflection and Preservation of Properties in Coalgebraic (bi)Simulations"],"prefix":"10.1007","author":[{"given":"Ignacio","family":"F\u00e1bregas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel","family":"Palomino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"de Frutos Escrig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.P.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"issue":"1-2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2004.07.019","volume":"327","author":"F. Bartels","year":"2004","unstructured":"Bartels, F., Sokolova, A., de Vink, E.P.: A hierarchy of probabilistic system types. Theor. Comput. Sci.\u00a0327(1-2), 3\u201322 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR3","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"16_CR4","unstructured":"de Frutos Escrig, D., Palomino, M., F\u00e1bregas, I.: Multiset bisimulation as a common framework for ordinary and probabilistic bisimulations (submitted)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","first-page":"4460","volume-title":"Automata, Languages and Programming","author":"E.P. Vink de","year":"1997","unstructured":"de Vink, E.P., Rutten, J.J.M.M.: Bisimulation for probabilistic transition systems: a coalgebraic approach. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 4460\u20134470. Springer, Heidelberg (1997)"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"F\u00e1bregas, I., Palomino, M., de Frutos Escrig, D.: Reflection and preservation of properties in coalgebraic (bi)simulations (extended) (2007), http:\/\/maude.sip.ucm.es\/~miguelpt\/","DOI":"10.1007\/978-3-540-75292-9_16"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/11817949_27","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"I. Hasuo","year":"2006","unstructured":"Hasuo, I.: Generic forward and backward simulations. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 406\u2013420. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"16_CR8","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. Comput. Sci.\u00a0327(1-2), 71\u2013108 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR9","unstructured":"Jacobs, B.: Introduction to Coalgebra. Towards Mathematics of States and Observations. Book in preparation. Draft available in the web, http:\/\/www.cs.ru.nl\/B.Jacobs\/CLG\/JacobsCoalgebraIntro.pdf"},{"key":"16_CR10","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Categorical Logic and Type Theory","author":"B. Jacobs","year":"1999","unstructured":"Jacobs, B.: Categorical Logic and Type Theory. Studies in Logic and the Foundations of Mathematics, vol.\u00a0141. North-Holland, Amsterdam (1999)"},{"key":"16_CR11","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"Jacobs, B., Rutten, J.J.M.M.: A tutorial on (co)algebras and (co)induction. Bulletin of the European Association for Theoretical Computer Science\u00a062, 222\u2013259 (1997)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/s100090050040","volume":"4","author":"Y. Kesten","year":"2000","unstructured":"Kesten, Y., Pnueli, A.: Control and data abstraction: The cornerstones of practical formal verification. International Journal on Software Tools for Technology Transfer\u00a04(2), 328\u2013342 (2000)","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"16_CR13","unstructured":"Kurz, A.: Logics for coalgebras and applications to computer science. PhD thesis, Universit\u00e4t M\u00fcnchen (2000)"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01384313","volume":"6","author":"C. Loiseaux","year":"1995","unstructured":"Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design\u00a06, 1\u201336 (1995)","journal-title":"Formal Methods in System Design"},{"key":"16_CR15","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"16_CR16","unstructured":"Palomino, M.: Reflexi\u00f3n, abstracci\u00f3n y simulaci\u00f3n en la l\u00f3gica de reescritura. PhD thesis, Universidad Complutense de Madrid, Spain (March 2005)"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Pattinson, D.: Expressivity Results in the Modal Logic of Coalgebras. PhD thesis, Universit\u00e4t M\u00fcnchen (2001)","DOI":"10.1007\/3-540-44693-1_45"},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2007"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75292-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T20:50:24Z","timestamp":1556830224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75292-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540752905","9783540752929"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75292-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}