{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:44Z","timestamp":1725542924494},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373766"},{"type":"electronic","value":"9783540373773"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11817949_17","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T19:59:29Z","timestamp":1154548769000},"page":"248-262","source":"Crossref","is-referenced-by-count":5,"title":["Sortings for 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\u20132","key":"17_CR1","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":"17_CR2","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":"17_CR3","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/604131.604135","volume-title":"POPL 2003: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages","author":"O.H. Jensen","year":"2003","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and transitions. In: POPL 2003: Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 38\u201349. ACM Press, New York (2003)"},{"key":"17_CR4","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and mobile processes (revised). Technical Report UCAM-CL-TR-580, University of Cambridge Computer Laboratory (2004)"},{"issue":"1","key":"17_CR5","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":"17_CR6","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., Soboci\u0144ski, 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":"17_CR7","first-page":"311","volume-title":"LICS 2005: Proceedings of the twentieth annual IEEE symposium on Logic in computer science","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Sobocinski, P.: Reactive systems over cospans. In: LICS 2005: Proceedings of the twentieth annual IEEE symposium on Logic in computer science, pp. 311\u2013320. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"17_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":"17_CR9","unstructured":"Jensen, O.H.: Mobile Processes in Bigraphs. PhD thesis, University of Aalborg (forthcoming, 2006)"},{"key":"17_CR10","unstructured":"Milner, R., Leifer, J.J.: Transition systems, link graphs and Petri nets. Technical report, University of Cambridge, Computer Laboratory (2004)"},{"key":"17_CR11","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"7","volume-title":"GTVC 2005: Proceedings of the Graph Transformation for Verification and Concurrency workshop","author":"M. Bundgaard","year":"2006","unstructured":"Bundgaard, M., Hildebrandt, T.: Bigraphical semantics of higher-order mobile embedded resources with local names. In: GTVC 2005: Proceedings of the Graph Transformation for Verification and Concurrency workshop. Electronic Notes in Theoretical Computer Science, vol.\u00a0154, pp. 7\u201329. Elsevier, Amsterdam (2006)"},{"key":"17_CR12","unstructured":"Birkedal, L., Debois, S., Elsborg, E., Hildebrandt, T., Niss, H.: Bigraphical Models of Context-aware Systems. Technical Report\u00a074, IT University of Copenhagen (2005) ISBN: 87-7949-110-3"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","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, pp. 187\u2013201. Springer, Heidelberg (2006)"},{"key":"17_CR14","unstructured":"Birkedal, L., Debois, S., Hildebrandt, T.: Sortings for reactive systems. Technical Report\u00a084, IT University of Copenhagen (2006) ISBN 87-7949-124-3"},{"key":"17_CR15","series-title":"Studies in logic and the foundation 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 foundation of mathematics, vol.\u00a0141. Elsevier, Amsterdam (1999)"},{"key":"17_CR16","unstructured":"Poincar\u00e9, H.: Science and Method. Dover Publications, New York (1914) (Translation by Francis Maitland)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"17_CR18","doi-asserted-by":"crossref","unstructured":"Conforti, G., Macedonio, D., Sassone, V.: Spatial logics for bigraphs. Computer Science Report\u00a002, University of Sussex (2005)","DOI":"10.1007\/11523468_62"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-540-24634-3_6","volume-title":"Coordination Models and Languages","author":"P. Braione","year":"2004","unstructured":"Braione, P., Picco, G.P.: On calculi for context-aware coordination. In: De Nicola, R., Ferrari, G.-L., Meredith, G. (eds.) COORDINATION 2004. LNCS, vol.\u00a02949, pp. 38\u201354. Springer, Heidelberg (2004)"},{"key":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-44450-5_30","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"B. K\u00f6nig","year":"2000","unstructured":"K\u00f6nig, B.: A General Framework for Types in Graph Rewriting. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 373\u2013384. Springer, Heidelberg (2000)"},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Honda, K.: Composing processes. In: POPL 1996: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 344\u2013357 (1996)","DOI":"10.1145\/237721.237802"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2006 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11817949_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:47Z","timestamp":1605644147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11817949_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373766","9783540373773"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11817949_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}