The space and motion of communicating agents

The Space and Motion of Communicating Agents

Volumn 9780521490306, Issue , 2009, Pages 1-191

  Milner, Robin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL CELLS; COMMUNICATING AGENTS; COMPUTING SYSTEM; CONCURRENT PROCESS; INTERACTING AGENTS; INTERACTIVE AGENTS; STRUCTURAL THEORIES; UBIQUITOUS SYSTEMS;

COMPUTATION THEORY;

EID: 84924452673     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9780511626661     Document Type: Book

References (83)

1. Ubiquitous computing: experience, design and science. A Grand Challenge of UKCRC, the UK Computing Research Committee. http://www-dse.doc.ic.ac.uk/Projects/UbiNet/GC/Manifesto/manifesto.pdf.
2. Equator. A 6-year Interdisciplinary Research Collaboration funded by the UK Engineering and Physical Sciences Research Council.http://www.equator.ac.uk.
3. Baeten, J. and Weijland, W. (1990), Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press.
4. Barr, C. and Wells, M. (1990), Category Theory for Computing Science. Prentice Hall.
5. Benson, D. (1975), The basic algebraic structures in categories of derivations. Information and Control28, 1-29.
6. Berry, G., and Boudol, G. (1992), The chemical abstract machine. Journal of Theoretical Computer Science 96, 217-248.
7. Bettini, L. and De Nicola, R. (2005), Mobile distributed programming in X-Klaim. In: SFM-05:Moby, 5th International School on Formal Methods for the Design of Computer, Communication and Software Systems: Mobile Computing, Lecture Notes in Computer Science 3465, Springer-Verlag, 29-68.
8. Bergstra, J. and Klop, J.-W. (1985), Algebra of communicating processes with abstraction. Theoretical Computer Science37, 77-121.
9. Birkedal, L. and Hildebrandt, T. (2004), Bigraphical programming languages. Laboratory for Context-Dependent Mobile Communication, IT University, Denmark. http://www.itu.dk/research/bpl/.
10. Birkedal, L., Bundgaard, M., Damgaard, T., Debois, S., Elsborg, E., Glenstrup, A., Hildebrandt, T., Milner, R. and Niss, H. (2006), Bigraphical programming languages for pervasive computing. In: Proc. International Workshop on Combining Theory and Systems Building in Pervasive Computing, 653-658.
11. Birkedal, L., Debois, S., Elsborg, E., Hildebrandt, T. and Niss, H. (2006), Bigraphical models of context-aware systems. In: Proc. 9th International Conference on Foundations of Software Science and Computation Structure, Lecture Notes in Computer Science 3921, 187-201.
12. Birkedal, L., Damgaard, T., Glenstrup, A. and Milner, R. (2007), Matching of bigraphs. In: Proc. Workshop on Graph Transformation for Verification and Concurrency, Electronic Notes in Theoretical Computer Science 175, Elsevier, 3-19.
13. Brookes, S., Hoare, C. and Roscoe, W. (1984), A theory of communicating sequential processes. J. ACM31, 560-599.
14. Birkedal, L., Debois, S. and Hildebrandt, T. (2008), On the construction of sorted reactive systems. In: Proc. 19th International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 5201, 218-232.
15. Bundgaard, M. and Hildebrandt, T. (2006), Bigraphical semantics of higher-order mobile embedded resources with local names. In: Proc. Workshop on Graph Transformation for Verification and Concurrency, Electronic Notes in Theoretical Computer Science 154, Elsevier, 7-29.
16. Bundgaard, M. and Sassone, V. (2006), Typed polyadic pi-calculus in bigraphs. In: Proc. 8th ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, 1-12.
17. Bundgaard, M., Glenstrup, A., Hildebrandt, T., Hpjsgaard, E. and Niss, H. (2008), Formalising higher-order mobile embedded business processes with binding bigraphs. In: Proc. 10th International Conference on Coordination Languages, Lecture Notes in Computer Science 5052, 83-99.
18. Cardelli, L. and Gordon, A. D. (2000), Mobile ambients.Theoretical Computer Science240, 177-213.
19. Castellani, I. (2001), Process algebras with localities. In: Handbook of Process Algebra, eds Bergstra, J., Ponse, A. and Smolka, S., Elsevier, 945-1045.
20. Cattani, G. L., Leifer, J. J. and Milner, R. (2000), Contexts and embeddings for closed shallow action graphs. University of Cambridge Computer Laboratory, Technical Report 496.
21. Cheverst, K., Davies, N., Mitchell, K. and Friday, A. (2000), Experiences of developing and deploying a context-aware tourist guide: the GUIDE project. In: Proc. Mobicom, Boston, Massachusetts, 20-31.
22. Clavel, M., Eker, S., Lincoln, P. and Meseguer, J. (1996), Priniciples of Maude. In: J. Meseguer (ed.)Proc. First International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science 4, Elsevier, 1-25.
23. Conforti, G., Macedonio, D. and Sassone, V. (2005), Spatial logics for bigraphs. In: International Conference on Automata, Languages and Programming, Lecture Notes in Computer Science 3580, Springer-Verlag, 766-778.
24. Conforti, G., Macedonio, D. and Sassone, V. (2005), Bigraphical Logics for XML. In: Proc. 13th Italian Symposium on Advanced Datebase Systems (SEBD), 392-399.
25. Crowcroft, J. (2006), The privacy and safety impact of technology choices for command, communications and control of the public highway. SIGCOMM Comput. Commun. Rev. 36(1), 53-58.
26. Damgaard, T. and Birkedal, L. (2006), Axiomatizing binding bigraphs. Nordic Journal of Computing 13(1-2), 58-77.
27. Danos, V., Feret, J., Fontana, W. and Krivine, J. (2007), Scalable modelling of biological pathways. In: Z. Shao (ed.), Proceedings ofAPLAS,4807, 139-157.
28. Dix, A. et al.(2000), Exploiting space and location as a design framework for interactive mobile systems. ACM Trans. Comput. Human Interact7(3), 285-321.
29. Ehrig, H. (1979), Introduction to the algebraic theory of graph grammars. In: Graph Grammars and their Application to Computer Science and Biology, Lecture Notes in Computer Science 73, Springer-Verlag, 1-69.
30. Ehrig, H. (2002), Bigraphs meet double pushouts. EATCS Bulletin 78, October 2002, 72-85.
31. Gadducci, F., Heckel, R. and Llabres, M. (1999), A bi-categorical axiomatisation of concurrent graph rewriting. In: Proc. 8th Conference on Category Theory in Computer Science (CTCS), Electronic Notes in Theoretical Computer Science 29, Elsevier Science.
32. Gadducci, F. and Montanan, U. (2000), The tile model. In: Plotkin, G., Stirling, C. and Tofte, M. (eds) Proof, Language and Interaction, MIT Press, 133-166.
33. Gardner, P. (2000), From process calculi to process frameworks. In: Proc. 11th International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 1877, Springer-Verlag, 69-88.
34. Gardner, P. and Wischik, L. (2000), Explicit fusions. In: Proc. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 1893, SpringerVerlag, 373-382.
35. Grohmann, D. and Miculan, M. (2007), Directed bigraphs. In: Proceedings of 23rd MFPS Conference, Electronic Notes in Computer Science 173, Elsevier, 121-137.
36. Grohmann, D. and Miculan, M. (2007), Reactive systems over directed bigraphs. In: Proceedings of 18th Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 4703, Springer-Verlag, 380-394.
37. Grohmann, D. and Miculan, M. (2008), An algebra for directed bigraphs. In: Proc. 4th International Workshop in Computing with Terms and Graphs, Electronic Notes in Theoretical Computer Science203(1), 49-63.
38. Hasegawa, M. (1999), Models of sharing graphs. PhD Dissertation, Division of Informatics, University of Ednburgh. Available as Technical Report ECS-LFCS-97-360. Also in Springer Series of Distinguished Dissertations in Computer Science.
39. Hennessy, M. (2007), A Distributed Pi Calculus. Cambridge University Press.
40. Hennessy, M. and Milner, R. (1985), Algebraic laws for non-determinism and concurrency. Journal of ACM32, 137-161.
41. Hildebrandt, T., Niss, H. and Olsen M. (2006), Formalising business process execution with bigraphs and Reactive XML. In: Proc. 8th International Conference on Coordination Models and Languages, Lecture Notes in Computer Science 4038, Springer Verlag, 113-129.
42. Hillston, J. (1996), A CompositionalApproach to Performance Modelling. Cambridge University Press.
43. Hirsch, D. and Montanari, U. (2001), Synchronised hyperedge replacement with name mobility. In: Proc. 12th International Conference on Concurrency Theory (CONCUR), Lecture Notes in Computer Science 2154, Springer-Verlag, 121-136.
44. Hoare, C.A.R. (1985), Communicating Sequential Processes. Prentice Hall.
45. Dash, R., Parkes, D. and Jennings, N. (2003), Computational mechanism design: a call to arms. IEEE Intell. Syst.18(6), 40-47.
46. Jensen, O. H. (2006), Mobile Processes in Bigraphs. Monograph available at http://www.cl.cam.ac.uk/~rm135/Jensen-monograph.html.
47. Jensen, O. H. and Milner, R. (2003), Bigraphs and transitions. In: 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM Press, 38-49.
48. Jensen, O. H. and Milner, R. (2004), Bigraphs and mobile processes (revised). Technical Report UCAM-CL-TR-580, University of Cambridge Computer Laboratory.
49. Joyal, A. (1986), Foncteurs analytiques et espèces de structures. In: Proc. Colloque de combinatoire énumérative, LectureNotes in Mathematics 1234, Springer-Verlag, 126-159.
50. Kelly, G. M. (1982), Basic Concepts of Enriched Category Theory.Lecture Notes in Mathematics 64, Cambridge University Press. Republished (2005) in Theory and Applications of Categories 10, 1-136.
51. Krivine, J., Milner, R. and Troina, A. (2008), Stochastic bigraphs. In: Proc. 24th International Conference on Mathematical Foundations of Programming Systems, to appear in Electronic Notes in Theoretical Computer Science.
52. Lafont, Y. (1990), Interaction nets. In: Proc. 17th ACM Symposium on Principles of Programming Languages, ACM Press, 95-108.
53. Lawvere, F.W. (1973), Metric spaces, generalized logic, and closed categories. Rendiconti del Seminario Matematico e Fisico di Milano XLII, 135-166. Republished (2002) inReprints in Theory and Applications of Categories, 1, 1-37.
54. Leifer, J. J. (2001), Operational congruences for reactive systems. PhD Dissertation, University of Cambridge Computer Laboratory. Distributed in revised form as Technical Report 521. Available from http://pauillac.inria.fr/~leifer.
55. Leifer, J. J. and Milner, R. (2000), Deriving bisimulation congruences for reactive systems. In: Proc. CONCUR 2000,11th International Conference on Concurrency Theory, Lecture Notes in Computer Science 1877, Springer-Verlag, 243-258. Available athttp://pauillac.inria.fr/~leifer.
56. Leifer, J. J. and Milner, R. (2006), Transition systems, link graphs and Petri nets. Mathematical Structures in Computer Science16, 989-1047.
57. Meseguer, J. (1992), Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96, 73-155.
58. Meseguer, J. and Montanari, U. (1990), Petri nets are monoids. Information and Computation88, 105-155.
59. Milne, G. and Milner, R. (1979), Concurrent processes and their syntax. J. ACM 26, 302-321.
60. Milner, R. (1979), Flow graphs and flow algebras. J. ACM 26, 794-818.
61. Milner, R. (1980), A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer-Verlag.
62. Milner, R. (1996), Calculi for interaction. Acta Informatica33, 707-737.
63. I Milner, R. (1999), Communicating and Mobile Systems: The π-calculus. Cambridge University Press.
64. Milner, R. (2001), Bigraphical reactive systems. In: Proc. 12th International Conference on Concurrency Theory, Lecture Notes in Computer Science 2154, Springer-Verlag, 16-35.
65. Milner, R. (2005), Axioms for bigraphical structure. Mathematical Structures in Computer Science15, 1005-1032.
66. Milner, R. (2006), Pure bigraphs: Structure and dynamics. Information and Computation204, 60-122.
67. Milner, R. (2006), Ubiquitous computing: Shall we understand it?The Computer Journal 49, 383-389. (The first Computer Journal Lecture.)
68. Milner, R., Parrow, J. and Walker D. (1992), A calculus of mobile processes, Parts I and II. Journal of Information and Computation 100, 1-40 and 41-77.
69. Park, D. (1981), Concurrency and automata on infinite sequences. In: Proc. 5th GI-Conference Conference on Theoretical Computer Science, Lecture Notes in Computer Science 104, Springer-Verlag, 167-183.
70. Parrow, J. and Victor, B. (1998), The fusion calculus: expressiveness and symmetry in mobile processes. In: Proceedings of Logics in Computer Science 1998, IEEE Computer Society Press, 176-185.
71. Petri, C. (1962), Kommunikation mit Automaten. Institut für Instrumentelle Informatik, Schriften des IIM 2, 1962.
72. Priami, C. (1995), Stochastic π-calculus. The Computer Journal38(6), 578-589.
73. Regev, A., Silverman, W. and Shapiro, E. (2001), Representation and simulation of biochemical processes using the π-calculus process algebra. In: Proc. Pacific Symposium of Biocomputing 2001 (PSB2001), Vol. 6, 459-470.
74. Sangiorgi, D. and Walker, D. (2001), The π-calculus: A Theory of Mobile Processes.Cambridge University Press.
75. Sassone, V. and Sobocinski, P. (2002), Deriving bisimulation congruences: a 2-categorical approach. Electronic Notes in Theoretical Computer Science68(2), 105-123.
76. Sassone, V. and Sobocinski, P. (2005), Locating reaction with 2-categories. Theoretical Computer Science333, 297-327.
77. Sewell, P. (2002), From rewrite rules to bisimulation congruences. Theoretical Computer Science274, 183-230.
78. Sloman, M. et al. (2007), AMUSE: Autonomic management of ubiquitous e-health systems. In: Concurrency and Computation: Practice and Experience, John Wiley & Sons.
79. Bezem, M., Klop, J.-W. and de Vrijer, R.et al. (2003) Term Rewriting Systems. Cambridge University Press.
80. Weiser, M. (1991), The computer for the 21st century. Sci. Am. 265(3), 94-104.
81. Wojciechowski, P. T and Sewell, P. (1999), Nomadic Pict: Language and infrastructure design for mobile agents. In: Proc. ASA/MA, Palm Springs, California.
82. Wooldridge, M. (1999), Intelligent agents. In: Multi-Agent Systems, MIT Press.
83. Zhang, M., Shi, L., Zhu, L., Wang, Y., Feng, L. and Pu, F. (2008), Abigraphical model of WSBPEL. In: 2nd Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering, IEEE Computer Society, 117-120.