Pure bigraphs: Structure and dynamics

Information and Computation

Volumn 204, Issue 1, 2006, Pages 60-122

  Milner, Robin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL SYSTEMS; CALCULATIONS; PETRI NETS; UBIQUITOUS COMPUTING;

ABSTRACT STRUCTURES; BIGRAPHICAL REACTIVE SYSTEMS; GRAPHICAL STRUCTURES; LABELLED TRANSITIONS; MOBILE AMBIENTS; REACTIVE SYSTEM; STRUCTURE AND DYNAMICS; UNIFORM FRAMEWORK;

COMPUTATION THEORY;

EID: 84855204888     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.07.003     Document Type: Article

References (53)

1. H. P. Barendregt, The Lambda Calculus, in: Studies in Logic and the Foundations of Mathematics, vol. 103, North-Holland, 1981.
2. J. A. Bergstra, J. W. Klop, Algebra for communicating processes with abstraction, Theoretical Computer Science 37(1985) 77-121.
3. G. Berry, G. Boudol, The chemical abstract machine, Journal of Theoretical Computer Science 96(1992) 217-248.
4. L. Birkedal, T. Hildebrandt, Bigraphical programming languages. LaCoMoCo.itu.dk, Laboratory for Context-Dependent Mobile Communication, IT University, Denmark, 2004.
5. S. D. Brookes, C. A. R. Hoare, A. W. Roscoe, A theory of communicatingsequential processes, Journal of ACM 31(1984) 560-599.
6. L. Cardelli, Bioware languages, in: Computer Systems: Theory, Technology and Applications, Papers for Roger Needham, Springer Monographs in Computer Science, pp. 6, 2003.
7. L. Caires, L. Cardelli, A spatial logic for concurrency (Part I), in: Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software, Lecture Notes and Computer Science, vol. 2215, Springer, pp. 1-37.
8. L. Cardelli, A. D. Gordon, Mobile ambients. Foundations of System Specification and Computational Structures, Lecture Notes and Computer Sciences, vol. 1378, pp. 140-155.
9. I. Castellani, Process algebras with localities, in: Bergstra, Ponse, Smolka (Eds.), Handbook of Process Algebra, Elsevier, Amsterdaam, 2001, pp. 947-1045.
10. G. L. Cattani, J. J. Leifer, R. Milner, Contexts and Embeddings for closed shallow action graphs. University of Cambridge Computer Laboratory, Technical Report 496. Available from: , 2000.
11. G. Conforti, D. Macedonio, V. Sassone, Bilogics: spatial-nominal logics for bigraphs, 2005. Manuscript, available at http://www.informatics.sussex.ac. uk/users/vs.
12. F. Drewes, B. Hoffmann, D. Plump, Hierarchical graph transformation, in: Foundations of Software Science and Computation Structures, Lecture Notes in Computer Series, vol. 1784, Springer, Berlin, 2000.
13. H. Ehrig, Introduction to the theory of graph grammars, in: Graph Grammars and their Application to Computer Science and Biology, Lecture Notes in Computer Series, vol. 73, Springer, Berlin, pp. 1-69.
14. H. Ehrig, Bigraphs meet double pushouts. EATCS Bulletin 78, October 2002, 2002, pp. 72-85.
15. C. Fournet, G. Gonthier, The reflexive Cham and the join calculus, in: Proceedings of the 23rd Annual ACM Symposium on Principles of Programming Languages, Florida, 1996, pp. 372-385.
16. F. Gadducci, R. Heckel, M. Llabrés Segura, A bi-categorical axiomatisation of concurrent graph rewriting, in: Proceedings of the 8th Conference on Category Theory in Computer Science (CTCS'99), Electronic Notes in TCS, vol. 29, Elsevier Science, Amsterdams, 1999.
17. P. A. Gardner, From process calculi to process frameworks, in: Proceedings of the CONCUR 2000, 11th International Conference on Concurrency Theory, 2000, pp. 69-88.
18. P. A. Gardner, L. Wischik, Explicit fusions, in: Proceedings of the MFCS 2000, Lecture Notes in Computer Series, vol. 1893, 2000, pp. 373-383.
19. D. Hirsch, U. Montanari, Synchronised hyperedge replacement with name mobility, in: Proceedings of the 12th International Conference on Concurrency Theory (CONCUR 2001), Lecture Notes in Computer Series, vol. 2154, 2001, pp. 121-136.
20. C. A. R. Hoare, Communicating Sequential Processes, Prentice Hall, SA, 1985.
21. O. H. Jensen, Forthcoming PhD Dissertation, 2005.
22. O. H. Jensen, R. Milner, Bigraphs and transitions, in: 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003.
23. O. H. Jensen, R. Milner, Bigraphs and mobile processes (revised). Technical Report UCAM-CL-TR-580, University of Cambridge Computer Laboratory, 2004.
24. Y. Lafont, Interaction nets, in: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL'90), 1990, pp. 95-108. (Pubitemid 20681744)
25. J. J. Leifer, Operational congruences for reactive systems. PhD Dissertation, University of Cambridge Computer Laboratory. Distributed in revised form as Technical Report 521. Available from: 2001.
26. J. J. Leifer, R. Milner, Deriving bisimulation congruences for reactive systems, in: Proceedings of the CON-CUR 2000, 11th International Conference on Concurrency theory, 2000, pp. 243-258. Available from: .
27. J. J. Leifer, R. Milner, Transition systems, link graphs and Petri nets. Technical Report 598, University of Cambridge Computer Laboratory. Revised version to appear Mathematical Structures in Computer Science, 2006. Available from: .
28. M. Merro, M. Hennessy, Bisimulation Congruences in Safe Ambients, in: Proceedings of the 29th International Symposium on Principles of Programming Languages, Oregon, 2002, pp. 71-80. (Pubitemid 35009031)
29. M. Merro, F. Zappa Nardelli, Bisimulation proof methods for mobile ambients, in: Proceedings of the ICALP 2003, Springer, Berlin, 2003.
30. R. Milner, in: A Calculus of Communicating Systems, Lecture Notes in Computer Series, vol. 92, Springer, Berlin, 1980.
31. R. Milner, Communicatingand Mobile Systems: The π-Calculus, Cambridge University Press, Cambridge, 1999.
32. R. Milner, Calculi for interaction, Acta Informatica 33(1996) 707-737. (Pubitemid 126328057)
33. R. Milner, Computational flux, in: Proceedings of the 28th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, 2001, pp. 220-221. (Pubitemid 32394129)
34. R. Milner, Bigraphical reactive systems, in: Proceedings of the 12th International Conference on Concurrency Theory, Lecture Notes in Computer Series, vol. 2154, 2001, pp. 16-35. (Pubitemid 33326645)
35. R. Milner, Bigraphical reactive systems: basic theory. Technical Report 503, University of Cambridge Computer Laboratory, 2001. Available from: .
36. R. Milner, Bigraphs for Petri nets, in: Proceedings of the Advanced course in Petri nets (Eichstaett'03), Lecture Notes in Computer Series 3098, 2004.
37. R. Milner, Axioms for bigraphical structure. Mathematical Structures in Computer Science (to appear) 2006. Available from: .
38. R. Milner, Bigraphs whose names have multiple locality. Technical Report TR603, University of Cambridge Computer Laboratory, 2005. Available from: .
39. R. Milner, Pure bigraphs. Technical Report 614, University of Cambridge Computer Laboratory, 2005.
40. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, Parts I and II, Journal of Information and Computation 100(1992) 1-40.
41. D. M. R. Park, Concurrency and automata on infinite sequences, in: Lecture Notes in Computer Sciences, vol. 104, Springer, Berlin, 1980.
42. J. Parrow, B. Victor, The fusion calculus: expressiveness and symmetry in mobile processes, in: Proceedings of LICS'98, IEEE Computer Society Press, 1998.
43. C. Priami, Stochastic π-calculus, Computer Journal 38(7) (1995) 578-589.
44. C. Priami, A. Regev, W. Silverman, E. Shapiro, Application of stochastic process algebras to bioinformatics of molecular processes, Information Processing Letters 80(2001) 25-31. (Pubitemid 32833107)
45. A. Regev, W. Silverman, E. Shapiro, Representation and simulation of biochemical processes using theπ-process algebra, in: Proceedings of the Pacific Symposium of Biocomputing 2001 (PSB2001), vol. 6, 2001, pp. 459-470.
46. W. H. Rounds, H. Song, The Φ-calculus-a language for distributed control of reconfigurable embedded systems, in: Hybrid Systems: Computation and control, Lecture Notes in Computer Series, vol. 2263, Springer, Berlin, 2003, pp. 435-449.
47. D. Sangiorgi, D. Walker, The π-Calculus, Cambridge University Press, Cambridge, 2001.
48. V. Sassone, P. Sobocinski, Deriving bisimulation congruences: a 2-categorical approach, Electronic Notes in Theoretical Computer Science 68(2) (2002) 19.
49. P. Sewell, From rewrite rules to bisimulation congruences, in: Proceedings of the CONCUR'98, Lecture Notes in Computer Series, vol. 1466, 1998, pp. 269-284. (Pubitemid 128125361)
50. Also Theoretical Computer Science, vol. 274 (1-2), 2002, pp. 183-230.
51. H. Smith, P. Fingar, Business process management: the third wave, Amazon com (2002).
52. Terese, Term Rewriting Systems, Cambridge University Press, 2003.
53. P. T. Wojciechowski, P. Sewell, Nomadic Pict: Language and infrastructure design for mobile agents, in: Proceedings of the ASA/MA'99, Palm Springs, California, 1999.