{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:59:22Z","timestamp":1743022762766,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642009440"},{"type":"electronic","value":"9783642009457"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00945-7_8","type":"book-chapter","created":{"date-parts":[[2009,4,4]],"date-time":"2009-04-04T00:57:53Z","timestamp":1238806673000},"page":"126-140","source":"Crossref","is-referenced-by-count":4,"title":["Type Systems for Bigraphs"],"prefix":"10.1007","author":[{"given":"Ebbe","family":"Elsborg","sequence":"first","affiliation":[]},{"given":"Thomas T.","family":"Hildebrandt","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Sangiorgi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","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.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":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-540-85361-9_20","volume-title":"CONCUR 2008 - Concurrency Theory","author":"L. Birkedal","year":"2008","unstructured":"Birkedal, L., Debois, S., Hildebrandt, T.T.: On the construction of sorted reactive systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol.\u00a05201, pp. 218\u2013232. Springer, Heidelberg (2008)"},{"key":"8_CR3","series-title":"ENTCS","first-page":"7","volume-title":"Proceedings of GT-VC 2005","author":"M.N. Bundgaard","year":"2006","unstructured":"Bundgaard, M.N., Hildebrandt, T.T.: Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names. In: Proceedings of GT-VC 2005. ENTCS, vol.\u00a0154, pp. 7\u201329. Elsevier, Amsterdam (2006)"},{"key":"8_CR4","first-page":"1","volume-title":"Proceedings of PPDP 2006","author":"M.N. Bundgaard","year":"2006","unstructured":"Bundgaard, M.N., Sassone, V.: Typed polyadic pi-calculus in bigraphs. In: Proceedings of PPDP 2006, pp. 1\u201312. ACM Press, New York (2006)"},{"issue":"1-2","key":"8_CR5","first-page":"58","volume":"13","author":"T.C. Damgaard","year":"2006","unstructured":"Damgaard, T.C., Birkedal, L.: Axiomatizing Binding Bigraphs. Nordic Journal of Computing\u00a013(1-2), 58\u201377 (2006)","journal-title":"Nordic Journal of Computing"},{"issue":"1-3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0304-3975(03)00325-6","volume":"311","author":"A. Igarashi","year":"2004","unstructured":"Igarashi, A., Kobayashi, N.: A generic type system for the Pi-calculus. TCS\u00a0311(1-3), 121\u2013163 (2004)","journal-title":"TCS"},{"key":"8_CR7","unstructured":"Jensen, O.H.: Mobile Processes in Bigraphs (Draft). PhD thesis, King\u2019s College, University of Cambridge (submitted) (2007)"},{"key":"8_CR8","first-page":"38","volume-title":"Proceedings of POPL 2003","author":"O.H. Jensen","year":"2003","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and Transitions. In: Proceedings of POPL 2003, pp. 38\u201349. ACM Press, New York (2003)"},{"key":"8_CR9","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and mobile processes (revised). Technical Report UCAM-CL-TR-580, University of Cambridge (2004)"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0890-5401(02)93171-8","volume":"177","author":"N. Kobayashi","year":"2002","unstructured":"Kobayashi, N.: A type system for lock-free processes. Inf. & Comp.\u00a0177, 122\u2013159 (2002)","journal-title":"Inf. & Comp."},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11817949_16","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"N. Kobayashi","year":"2006","unstructured":"Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137, pp. 233\u2013247. Springer, Heidelberg (2006)"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00236-005-0180-4","volume":"42","author":"B. K\u00f6nig","year":"2005","unstructured":"K\u00f6nig, B.: A General Framework for Types in Graph Rewriting. Acta Inf.\u00a042(4), 349\u2013388 (2005); special issue: Types in concurrency, Part II","journal-title":"Acta Inf."},{"issue":"6","key":"8_CR13","first-page":"989","volume":"16","author":"J.J. Leifer","year":"2006","unstructured":"Leifer, J.J., Milner, R.: Transition systems, link graphs, and Petri nets. MSCS\u00a016(6), 989\u20131047 (2006)","journal-title":"MSCS"},{"key":"8_CR14","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)"},{"issue":"6","key":"8_CR15","first-page":"1005","volume":"15","author":"R. Milner","year":"2005","unstructured":"Milner, R.: Axioms for bigraphical structure. MSCS\u00a015(6), 1005\u20131032 (2005)","journal-title":"MSCS"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Milner, R.: Pure Bigraphs: Structure and dynamics. Inf. & Comp.\u00a0204(1) (2006)","DOI":"10.1016\/j.ic.2005.07.003"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Milner, R.: Local Bigraphs and Confluence: Two Conjectures. ENTCS\u00a0175(3) (June 2007)","DOI":"10.1016\/j.entcs.2006.07.035"},{"issue":"5","key":"8_CR18","first-page":"409","volume":"6","author":"B.C. Pierce","year":"1996","unstructured":"Pierce, B.C., Sangiorgi, D.: Typing and Subtyping for Mobile processes. MSCS\u00a06(5), 409\u2013453 (1996)","journal-title":"MSCS"},{"key":"8_CR19","volume-title":"The Pi-calculus: a Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The Pi-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"issue":"10","key":"8_CR20","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1109\/2.237456","volume":"26","author":"M. Weiser","year":"1993","unstructured":"Weiser, M.: Hot Topics \u2013 Ubiquitous Computing. IEEE Computer\u00a026(10), 71\u201372 (1993)","journal-title":"IEEE Computer"}],"container-title":["Lecture Notes in Computer Science","Trustworthy Global Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00945-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:58:47Z","timestamp":1558267127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00945-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642009440","9783642009457"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00945-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}