Type systems for bigraphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5474 LNCS, Issue , 2009, Pages 126-140

  Elsborg, Ebbe ^a   Hildebrandt, Thomas T ^a   Sangiorgi, Davide ^b  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIGRAPHICAL REACTIVE SYSTEMS; BIGRAPHS; META MODEL; PROOF OF CONCEPT; SUBJECT REDUCTION; SUBTYPING; TERM LANGUAGES; TYPE SYSTEMS;

BIOMINERALIZATION; COMPUTER SCIENCE; PATHOLOGY;

CALCULATIONS;

EID: 67650308261     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00945-7_8     Document Type: Conference Paper

References (20)

1. Birkedal, L., Debois, S., Elsborg, E., Hildebrandt, T.T., Niss, H.: Bigraphical models of context-aware systems. In: Aceto, L., Inǵ olfsd́ottir, A. (eds.) FOSSACS 2006. LNCS, vol.3921, pp. 187-201. Springer, Heidelberg (2006) (Pubitemid 44019340)
2. 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.5201, pp. 218-232. Springer, Heidelberg (2008)
3. 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.154, pp. 7-29. Elsevier, Amsterdam (2006)
4. Bundgaard, M.N., Sassone, V.: Typed polyadic pi-calculus in bigraphs. In: Proceedings of PPDP 2006, pp. 1-12. ACM Press, New York (2006) (Pubitemid 44729603)
5. Damgaard, T.C., Birkedal, L.: Axiomatizing Binding Bigraphs. Nordic Journal of Computing 13(1-2), 58-77 (2006)
6. Igarashi, A., Kobayashi, N.: A generic type system for the Pi-calculus. TCS 311(1- 3), 121-163 (2004)
7. Jensen, O.H.: Mobile Processes in Bigraphs (Draft). PhD thesis, King's College, University of Cambridge (submitted) (2007)
8. Jensen, O.H., Milner, R.: Bigraphs and Transitions. In: Proceedings of POPL 2003, pp. 38-49. ACM Press, New York (2003)
9. Jensen, O.H., Milner, R.: Bigraphs and mobile processes (revised). Technical Report UCAM-CL-TR-580, University of Cambridge (2004)
10. Kobayashi, N.: A type system for lock-free processes. Inf. & Comp. 177, 122-159 (2002) (Pubitemid 35312156)
11. Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.4137, pp. 233-247. Springer, Heidelberg (2006) (Pubitemid 44532578)
12. König, B.: A General Framework for Types in Graph Rewriting. Acta Inf. 42(4), 349-388 (2005); special issue: Types in concurrency, Part II (Pubitemid 41788295)
13. Leifer, J.J., Milner, R.: Transition systems, link graphs, and Petri nets. MSCS 16(6), 989-1047 (2006) (Pubitemid 44955483)
14. Milner, R.: Bigraphs for petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.3098, pp. 686-701. Springer, Heidelberg (2004) (Pubitemid 39739373)
15. Milner, R.: Axioms for bigraphical structure. MSCS 15(6), 1005-1032 (2005) (Pubitemid 43148454)
16. Milner, R.: Pure Bigraphs: Structure and dynamics. Inf. & Comp. 204(1) (2006)
17. Milner, R.: Local Bigraphs and Confluence: Two Conjectures. ENTCS 175(3) (June 2007)
18. Pierce, B.C., Sangiorgi, D.: Typing and Subtyping for Mobile processes. MSCS 6(5), 409-453 (1996) (Pubitemid 126148812)
19. Sangiorgi, D., Walker, D.: The Pi-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
20. Weiser, M.: Hot Topics - Ubiquitous Computing. IEEE Computer 26(10), 71-72 (1993)