{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:41:20Z","timestamp":1759178480568,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642327834"},{"type":"electronic","value":"9783642327841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32784-1_3","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T12:59:34Z","timestamp":1344862774000},"page":"40-50","source":"Crossref","is-referenced-by-count":9,"title":["Relational Presheaves as Labelled Transition Systems"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/3-540-60915-6_2","volume-title":"Logics for Concurrency","author":"S. Abramsky","year":"1996","unstructured":"Abramsky, S., Gay, S., Nagarajan, R.: Specification Structures and Propositions-as-Types for Concurrency. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol.\u00a01043, pp. 5\u201340. Springer, Heidelberg (1996)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S0960129500000189","volume":"3","author":"S. Abramsky","year":"1993","unstructured":"Abramsky, S., Vickers, S.: Quantales, observational logic and process semantics. Math. Struct. Comput. Sci.\u00a03, 161\u2013227 (1993)","journal-title":"Math. Struct. Comput. Sci."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"CTCS 1989","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, N.: A Final Coalgebra Theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) CTCS 1989. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"issue":"8","key":"3_CR4","first-page":"157","volume":"14","author":"J. Adamek","year":"2005","unstructured":"Adamek, J.: Introduction to coalgebra. Theor. App. Categories\u00a014(8), 157\u2013199 (2005)","journal-title":"Theor. App. Categories"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"B\u00e9nabou, J.: Introduction to bicategories, part 1. In: Midwest Category Seminar. LNM, vol.\u00a047, pp. 1\u201377. Springer (1967)","DOI":"10.1007\/BFb0074299"},{"key":"3_CR6","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: Logic in Computer Science, LiCS 2006. IEEE Press (2006)"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"4044","DOI":"10.1016\/j.tcs.2009.06.010","volume":"410","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Montanari, U.: Reactive systems (semi-)saturated semantics and coalgebras on presheaves. Theor. Comput. Sci.\u00a0410, 4044\u20134066 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/11539452_24","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"R. Bruni","year":"2005","unstructured":"Bruni, R., Gadducci, F., Montanari, U., Soboci\u0144ski, P.: Deriving Weak Bisimulation Congruences from Reduction Systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 293\u2013307. Springer, Heidelberg (2005)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-23217-6_21","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"R. Bruni","year":"2011","unstructured":"Bruni, R., Melgratti, H., Montanari, U.: A Connector Algebra for P\/T Nets Interactions. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011 \u2013 Concurrency Theory. LNCS, vol.\u00a06901, pp. 312\u2013326. Springer, Heidelberg (2011)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Burstall, R.M.: An algebraic description of programs with assertions, verification and simulation. In: Conference on Proving Assertions about Programs, pp. 7\u201314. ACM (1972)","DOI":"10.1145\/942580.807068"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V. Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible Communicating Systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 292\u2013307. Springer, Heidelberg (2004)"},{"key":"3_CR12","unstructured":"Danos, V., Krivine, J., Soboci\u0144ski, P.: General reversibility. In: Expressiveness in Concurrency, EXPRESS 2005. ENTCS. Elsevier (2005)"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Fiore, M.P., Cattani, G.L., Winskel, G.: Weak bisimulation and open maps. In: Logic in Computer Science, LiCS 1999. IEEE Press (1999)","DOI":"10.7146\/brics.v6i14.20071"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Gadducci, F., Montanari, U.: The tile model. In: Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133\u2013166. MIT Press (2000)","DOI":"10.7551\/mitpress\/5641.003.0010"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"843","DOI":"10.2307\/2275788","volume":"61","author":"S. Ghilardi","year":"1996","unstructured":"Ghilardi, S., Meloni, G.: Relational and partial variable sets and basic predicate logic. J. Symbolic Logic\u00a061(3), 843\u2013872 (1996)","journal-title":"J. Symbolic Logic"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Log. Meth. Comput. Sci.\u00a03(4) (2007)","DOI":"10.2168\/LMCS-3(4:11)2007"},{"issue":"1-2","key":"3_CR17","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 coalgebras. Theor. Comput. Sci.\u00a0327(1-2), 71\u2013108 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Trace semantics for coalgebras. In: Coalgebraic Methods in Computer Science, CMCS 2004. ENTCS, vol.\u00a0106, pp. 167\u2013184 (2004)","DOI":"10.1016\/j.entcs.2004.02.031"},{"key":"3_CR19","unstructured":"Jensen, O.H.: Mobile Processes in Bigraphs. PhD thesis, University of Cambridge (2006)"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/inco.1996.0057","volume":"127","author":"A. Joyal","year":"1994","unstructured":"Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Inf. Comput.\u00a0127, 164\u2013185 (1994)","journal-title":"Inf. Comput."},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0000480","volume-title":"Algebraic Methodology and Software Technology","author":"P. Katis","year":"1997","unstructured":"Katis, P., Sabadini, N., Walters, R.F.C.: Span(Graph): An Algebra of Transition Systems. In: Johnson, M. (ed.) AMAST 1997. LNCS, vol.\u00a01349, pp. 322\u2013336. Springer, Heidelberg (1997)"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Kelly, G.M., Street, R.H.: Review of the elements of 2-categories. In: Category Theory. LNM, vol.\u00a0420, pp. 75\u2013103. Springer (1973)","DOI":"10.1007\/BFb0063101"},{"key":"3_CR23","unstructured":"Koslowski, J.: Simulations as a genuinely categorical concepts, 2006. Talk at CT2006, White Point, Nova Scotia (June 30, 2006)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J.J. Leifer","year":"2000","unstructured":"Leifer, J.J., Milner, R.: Deriving Bisimulation Congruences for Reactive Systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"3_CR25","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.jlap.2004.03.008","volume":"60-61","author":"P. Mosses","year":"2004","unstructured":"Mosses, P.: Modular structural operational semantics. J. Logic Algebr. Progr.\u00a060-61, 195\u2013228 (2004)","journal-title":"J. Logic Algebr. Progr."},{"issue":"7","key":"3_CR26","first-page":"248","volume":"12","author":"S. Niefield","year":"2004","unstructured":"Niefield, S.: Change of base for relational variable sets. Theor. App. Categories\u00a012(7), 248\u2013261 (2004)","journal-title":"Theor. App. Categories"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Ribeiro, P.R., Barbosa, L.S., Wang, S.: An exercise on transition systems. In: Harnessing Theories for Tool Support in Software, TTSS 2007. ENTCS, vol.\u00a0207, pp. 89\u2013106 (2007)","DOI":"10.1016\/j.entcs.2008.03.087"},{"key":"3_CR28","unstructured":"Rosenthal, K.R.: The theory of Quantaloids. Addison-Wesley (1996)"},{"issue":"2","key":"3_CR29","first-page":"163","volume":"10","author":"V. Sassone","year":"2003","unstructured":"Sassone, V., Soboci\u0144ski, P.: Deriving bisimulation congruences using 2-categories. Nord. J. Comput.\u00a010(2), 163\u2013183 (2003)","journal-title":"Nord. J. Comput."},{"issue":"1-2","key":"3_CR30","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.tcs.2004.10.025","volume":"333","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Soboci\u0144ski, P.: Locating reaction with 2-categories. Theor. Comput. Sci.\u00a0333(1-2), 297\u2013327 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR31","unstructured":"Schmitt, V., Worytkiewicz, K.: Bisimulations of enrichments. arXiv:cs\/0602077v1 (2006)"},{"key":"3_CR32","unstructured":"Soboci\u0144ski, P.: Deriving process congruences from reaction rules. PhD thesis, BRICS, University of Aarhus (2004)"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Sokolova, A., de Vink, E., Woracek, H.: Weak bisimulation for action-type coalgebras. In: Category Theory in Computer Science, CTCS 2004. ENTCS, vol.\u00a0122, pp. 211\u2013228 (2004)","DOI":"10.1016\/j.entcs.2004.06.050"},{"key":"3_CR34","doi-asserted-by":"crossref","unstructured":"Staton, S.: Relating coalgebraic notions of bisimulations. Log. Meth. Comput. Sci.\u00a07(1) (2011)","DOI":"10.2168\/LMCS-7(1:13)2011"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Stell, J.G.: Granularity in change over time. In: Foundations of Geographic Information Science, pp. 95\u2013115. Taylor & Francis (2003)","DOI":"10.1201\/9780203009543.ch6"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: Logic in Computer Science, LiCS 1997, pp. 280\u2013291. IEEE Press (1997)","DOI":"10.1109\/LICS.1997.614955"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, pp. 1\u2013148. Oxford University Press (1995)","DOI":"10.1093\/oso\/9780198537809.003.0001"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Winskel, G., Nielsen, M.: Presheaves as transition systems. In: Partial Order Methods in Verification: DIMACS Workshop, pp. 129\u2013140 (1996)","DOI":"10.1090\/dimacs\/029\/08"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32784-1_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T21:02:25Z","timestamp":1743973345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32784-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642327834","9783642327841"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32784-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}