Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names

Electronic Notes in Theoretical Computer Science

Volumn 154, Issue 2 SPEC. ISS., 2006, Pages 7-29

  Bundgaard, Mikkel ^a   Hildebrandt, Thomas ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

bigraphs; local names; non linear process mobility

Indexed keywords

COMPUTER GRAPHICS; DISTRIBUTED COMPUTER SYSTEMS; EMBEDDED SYSTEMS; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS; NONLINEAR SYSTEMS;

HIGHER-ORDER MOBILE EMBEDDED RESOURCES; MOBILE AMBIENTS CALCULUS; TOPOGRAPHICAL META-MODEL;

SEMANTICS;

EID: 33646717084     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.03.029     Document Type: Article

References (18)

1. Abadi M., Cardelli L., Curien P.-L., and Levy J.-J. Explicit substitutions. Journal of Functional Programming 1 (1991) 375-416
2. Bruni R., and Lanese I. On graph(ic) encodings. In: Koenig B., Montanari U., and Gardner P. (Eds). Graph Transformations and Process Algebras for Modeling Distributed and Mobile Systems. Dagstuhl Seminar Proceedings number 04241 (2005)
3. Bundgaard M., Hildebrandt T., and Godskesen J.C. A CPS encoding of name-passing in higher-order mobile embedded resources. In: Baeten J., and Corradini F. (Eds). Proceedings of EXPRESS'04. Electronic Notes in Theoretical Computer Science 128 (2005) 131-150
4. Bundgaard, M., T. Hildebrandt and J.C. Godskesen, A CPS encoding of name-passing in higher-order mobile embedded resources, Theoretical Computer Science (2005),. Accepted for publication in a special issue of TCS
5. Carbone M., and Maffeis S. On the expressive power of polyadic synchronisation in π-calculus. Nordic Journal of Computing 10 (2003) 70-98
6. Castagna G., Vitek J., and Nardelli F.Z. The Seal calculus. Journal of Information and Computation 201 (2005) 1-54
7. Debois, S. and T.C. Damgaard, Bigraphs by example, Technical Report TR-2005-61, IT University of Copenhagen (2005)
8. Ferrari G., Montanari U., and Quaglia P. A π-calculus with explicit substitutions. Theoretical Computer Science 168 (1996) 53-103
9. Hildebrandt, T., J.C. Godskesen and M. Bundgaard, Bisimulation congruences for Homer - a calculus of higher order mobile embedded resources, Technical Report TR-2004-52, IT University of Copenhagen (2004)
10. Hirschkoff, D., Handling substitutions explicitely in the π-calculus, in: Proceedings of of WESTAPP'99, 1999, pp. 28-43
11. Jensen, O.H., "Mobile Processes in Bigraphs," Ph.D. thesis, Department of Computer Science, Aalborg University (2005), forthcoming
12. Jensen, O.H. and R. Milner, Bigraphs and transitions, in: Proceedings of POPL'03 (2003), pp. 38-49
13. Jensen, O.H. and R. Milner, Bigraphs and mobile processes (revised), Technical Report UCAM-CL-TR-580, University of Cambridge, Computer Laboratory (2004)
14. Milner R. Bigraphs for petri nets. In: Desel J., Reisig W., and Rozenberg G. (Eds). Lectures on Concurrency and Petri Nets: Advances in Petri Nets. Lecture Notes in Computer Science 3098 (2004) 686-701
15. Milner, R., Bigraphs whose names have multiple locality, Technical Report UCAM-CL-TR-603, University of Cambridge, Computer Laboratory (2004)
16. Milner, R., Local bigraphs, confluence and λ-calculus (2004), draft of October 31, 2004
17. Sangiorgi, D., "Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms," Ph.D. thesis, Department of Computer Science, University of Edinburgh (1992)
18. Thomsen B. Plain CHOCS: A second generation calculus for higher order processes. Acta Informatica 30 (1993) 1-59