{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:18:49Z","timestamp":1725560329963},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540286202"},{"type":"electronic","value":"9783540318767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11548133_2","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T20:07:40Z","timestamp":1279742860000},"page":"30-50","source":"Crossref","is-referenced-by-count":9,"title":["Labels from Reductions: Towards a General Theory"],"prefix":"10.1007","author":[{"given":"Bartek","family":"Klin","sequence":"first","affiliation":[]},{"given":"Vladimiro","family":"Sassone","sequence":"additional","affiliation":[]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-24727-2_12","volume-title":"Foundations of Software Science and Computation Structures","author":"H. Ehrig","year":"2004","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph re writing. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 151\u2013166. Springer, Heidelberg (2004)"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"133","DOI":"10.7551\/mitpress\/5641.003.0010","volume-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","author":"F. Gadducci","year":"2000","unstructured":"Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133\u2013166. MIT Press, Cambridge (2000)"},{"key":"2_CR3","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and mobile processes. Technical Report 570, University of Cambridge (2003)"},{"key":"2_CR4","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. Leifer","year":"2000","unstructured":"Leifer, 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":"2_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1090\/S0002-9904-1965-11234-4","volume":"71","author":"S. Mac Lane","year":"1965","unstructured":"Mac Lane, S.: Categorical algebra. Bulletin of the American Mathematical Society\u00a071, 40\u2013106 (1965)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"2_CR6","series-title":"Graduate Texts in Mathematics","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1992","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Graduate Texts in Mathematics. Springer, Heidelberg (1992)","edition":"2"},{"issue":"8","key":"2_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/s002360050067","volume":"33","author":"R. Milner","year":"1996","unstructured":"Milner, R.: Calculi for interaction. Acta Informatica\u00a033(8), 707\u2013737 (1996)","journal-title":"Acta Informatica"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44685-0_2","volume-title":"CONCUR 2001 - Concurrency Theory","author":"R. Milner","year":"2001","unstructured":"Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 16\u201335. Springer, Heidelberg (2001)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-540-27755-2_19","volume-title":"Lectures on Concurrency and Petri Nets","author":"R. Milner","year":"2004","unstructured":"Milner, R.: Bigraphs for petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.\u00a03098, pp. 686\u2013701. Springer, Heidelberg (2004)"},{"key":"2_CR10","unstructured":"Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department (1981)"},{"issue":"2","key":"2_CR11","first-page":"163","volume":"10","author":"V. Sassone","year":"2003","unstructured":"Sassone, V., Soboci\u0144ski, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing\u00a010(2), 163\u2013183 (2003)","journal-title":"Nordic Journal of Computing"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Sassone, V., Soboci\u0144ski, P.: A congruence for Petri nets. In: Workshop on Petri Nets and Graph Transformation. ENTCS, vol.\u00a0127, pp. 107\u2013120 (2005)","DOI":"10.1016\/j.entcs.2005.02.008"},{"issue":"1-2","key":"2_CR13","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. Theoretical Computer Science\u00a0333(1-2), 297\u2013327 (2005)","journal-title":"Theoretical Computer Science"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: Proceedings of Logics in Computer Science. LICS 2005. IEEE Press, Los Alamitos (2005)","DOI":"10.1109\/LICS.2005.40"},{"key":"2_CR15","unstructured":"Sewell, P.: Working notes PS15\u2013PS19, Unpublished notes (2000)"},{"issue":"1\u20132","key":"2_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(00)00309-1","volume":"274","author":"P. Sewell","year":"2002","unstructured":"Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science\u00a0274(1\u20132), 183\u2013230 (2002)","journal-title":"Theoretical Computer Science"},{"key":"2_CR17","unstructured":"Soboci\u0144ski, P.: Deriving process congruences from reaction rules. PhD thesis, BRICS, University of Aarhus (2004)"}],"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\/11548133_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T16:10:30Z","timestamp":1711642230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11548133_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540286202","9783540318767"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11548133_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}