{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T23:22:24Z","timestamp":1773789744607,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540853602","type":"print"},{"value":"9783540853619","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85361-9_20","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T12:28:04Z","timestamp":1219062484000},"page":"218-232","source":"Crossref","is-referenced-by-count":8,"title":["On the Construction of Sorted Reactive Systems"],"prefix":"10.1007","author":[{"given":"Lars","family":"Birkedal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f8ren","family":"Debois","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Hildebrandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.ic.2005.07.003","volume":"204","author":"R. Milner","year":"2006","unstructured":"Milner, R.: Pure bigraphs: Structure and dynamics. Information and Computation\u00a0204(1), 60\u2013122 (2006)","journal-title":"Information and Computation"},{"key":"20_CR2","unstructured":"Milner, R., Leifer, J.J.: Transition systems, link graphs and Petri nets. Technical Report 598, U. of Cambridge Computer Laboratory (2004)"},{"key":"20_CR3","unstructured":"Milner, R.: Bigraphs whose names have multiple locality. Technical Report 603, U. of Cambridge Computer Laboratory (2004)"},{"key":"20_CR4","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and mobile processes (revised). Technical Report 580, U. of Cambridge Computer Laboratory (2004)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1007\/978-3-540-27755-2_19","volume-title":"ACPN 2003","author":"R. Milner","year":"2004","unstructured":"Milner, R.: Bigraphs for petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol.\u00a03098, pp. 686\u2013701. Springer, Heidelberg (2004)"},{"key":"20_CR6","unstructured":"Jensen, O.H.: Mobile Processes in Bigraphs. PhD thesis, U. of Aalborg (forthcoming 2008)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Bundgaard, M., Sassone, V.: Typed polyadic pi-calculus in bigraphs. In: PPDP 2006, pp. 1\u201312 (2006)","DOI":"10.1145\/1140335.1140336"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-540-74407-8_26","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"D. Grohmann","year":"2007","unstructured":"Grohmann, D., Miculan, M.: Reactive systems over directed bigraphs. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 380\u2013394. Springer, Heidelberg (2007)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Bundgaard, M., Hildebrandt, T.: Bigraphical semantics of higher-order mobile embedded resources with local names. In: GT-VC 2005. ENTCS, vol.\u00a0154, pp. 7\u201329 (2006)","DOI":"10.1016\/j.entcs.2005.03.029"},{"key":"20_CR10","unstructured":"Milner, R.: Local bigraphs and confluence: Two conjectures. In: EXPRESS 2006, pp. 42\u201350 (2006)"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11690634_13","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Birkedal","year":"2006","unstructured":"Birkedal, L., Debois, S., Elsborg, E., Hildebrandt, T., Niss, H.: Bigraphical Models of Context-aware Systems. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921. Springer, Heidelberg (2006)"},{"key":"20_CR12","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":"20_CR13","doi-asserted-by":"crossref","unstructured":"Leifer, J.J.: Operational Congruences for Reactive Systems. PhD thesis, U. of Cambridge Computer Laboratory and Trinity College (2001)","DOI":"10.1007\/3-540-44618-4_19"},{"issue":"1\u20132","key":"20_CR14","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":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/11817949_17","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"L. Birkedal","year":"2006","unstructured":"Birkedal, L., Debois, S., Hildebrandt, T.: Sortings for reactive systems. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 248\u2013262. Springer, Heidelberg (2006)"},{"key":"20_CR16","unstructured":"Debois, S.: Sortings and Bigraphs. PhD thesis, IT University of Copenhagen (2008), http:\/\/www.itu.dk\/people\/debois\/pubs\/thesis.pdf"},{"key":"20_CR17","unstructured":"Leifer, J.J.: Synthesising labelled transitions and operational congruences in reactive systems, part\u00a02. Technical Report RR-4395, INRIA (2002)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1007\/11523468_62","volume-title":"Automata, Languages and Programming","author":"G. Conforti","year":"2005","unstructured":"Conforti, G., Macedonio, D., Sassone, V.: Spatial logics for bigraphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 766\u2013778. Springer, Heidelberg (2005)"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-36576-1_26","volume-title":"Foundations of Software Science and Computational Structures","author":"V. Sassone","year":"2003","unstructured":"Sassone, V., Sobocinski, P.: Deriving bisimulation congruences: 2-categories vs. precategories. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 409\u2013424. Springer, Heidelberg (2003)"},{"key":"20_CR20","first-page":"311","volume-title":"LICS 2005","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Sobocinski, P.: Reactive systems over cospans. In: LICS 2005, pp. 311\u2013320. IEEE, Los Alamitos (2005)"},{"key":"20_CR21","unstructured":"Milner, R.: Personal communication (2006)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11841883_13","volume-title":"Graph Transformations","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., Gadducci, F., K\u00f6nig, B.: Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 168\u2013183. Springer, Heidelberg (2006)"},{"issue":"6","key":"20_CR23","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1017\/S096012950600569X","volume":"16","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structures in Computer Science\u00a016(6), 1133\u20131163 (2006)","journal-title":"Mathematical Structures in Computer Science"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2008 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85361-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T15:15:45Z","timestamp":1738336545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85361-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540853602","9783540853619"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85361-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}