Axioms for bigraphical structure

Mathematical Structures in Computer Science

Volumn 15, Issue 6, 2005, Pages 1005-1032

  Milner, Robin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750714034     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129505004809     Document Type: Article

References (25)

1. Benson, D. B. (1975) The basic algebraic structures in categories of derivations. Information and Control 28 1-29.
2. Cardelli, L. and Gordon, A. D. (2000) Mobile ambients. In: Foundations of System Specification and Computational Structures. Springer-Verlag Lecture Notes in Computer Science 1378 140-155.
3. Cattani, G. L., Leifer, J. J. and Milner, R. (2000) Contexts and Embeddings for closed shallow action graphs. Technical Report 496, University of Cambridge Computer Laboratory. (Available at http://pauillac.inria.fr/~leifer.)
4. Ehrig, H. (1979) Introduction to the theory of graph grammars. In: Graph Grammars and their Application to Computer Science and Biology. Springer-Verlag Lecture Notes in Computer Science 73 1-69.
5. Ehrig, H. (2002) Bigraphs meet double pushouts. EATCS Bulletin 78 72-85.
6. Ehrig, H. and König, B. (2004) Deriving bisimulation congruences in the DPO approach to graph rewriting. In: Foundations of Software Science and Computation Structures, Proc. 7th International Conference. Springer-Verlag Lecture Notes in Computer Science 2987 151-166.
7. Gardner, P. A. (2000) From process calculi to process frameworks. Proc. CONCUR 2000, 11th International Conference on Concurrency Theory 69-88.
8. Jensen, O. H. (2004) Forthcoming Ph.D. Thesis.
9. Jensen, O. H. and Milner, R. (2003) Bigraphs and transitions. In: 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
10. Jensen, O. H. and Milner, R. (2004) Bigraphs and mobile processes (revised). Technical Report UCAM-CL-TR-580, University of Cambridge Computer Laboratory. (Available from http://www.cl.cam.ac.uk/users/rm135.)
11. Lawvere, F.W. (1963) Functorial semantics of algebraic theories. Proc. Nat. Acad. Sci. 50 869-872.
12. Leifer, J. J. (2001) Operational congruences for reactive systems, Ph.D. Dissertation, University of Cambridge Computer Laboratory. Distributed in revised form as Technical Report 521. (Available from http://pauillac.inria.fr/ ~leifer.)
13. Leifer, J. J. and Milner, R. (2000) Deriving bisimulation congruences for reactive systems. Proc. CONCUR 2000, 11th International Conference on Concurrency theory 243-258. (Available at http://pauillac.inria.fr/~leifer.)
14. Leifer, J. J. and Milner, R. (2004) Transition systems, link graphs and Petri nets. Technical Report 598, University of Cambridge Computer Laboratory. (Available from http://www.cl.cam.ac.uk/users/rm135.)
15. Meseguer, J. and Montanari, U. (1990) Petri nets are monoids. Information and Computation 88 105-155.
16. Milner, R. (1989) Communication and Concurrency, Prentice Hall.
17. Milner, R. (1996) Calculi for interaction. Acta Informatica 33 707-737.
18. Milner, R. (2001 a) Bigraphical reactive systems: basic theory. Technical Report 503, University of Cambridge Computer Laboratory. (Available from http://www.cl.cam.ac.uk/users/rm135.)
19. Milner, R. (2001b) Bigraphical reactive systems. Proc. 12th International Conference on Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 2154 16-35.
20. Milner, R. (2004) Bigraphs for Petri nets. Advanced Course in Petri Nets. Springer-Verlag Lecture Notes in Computer Science 3098.
21. Milner, R., Parrow, J. and Walker D. (1992) A calculus of mobile processes, Parts I and II. Information and Computation 100 1-40 and 41-77.
22. Regev, A., Panina, E., Silverman, W., Cardelli, L. and Shapiro, E. (2004) BioAmbients: an abstraction for biological compartments. Theoretical Computer Science (to appear).
23. Priami, C., Regev, A., Silverman, W. and Shapiro, E. (2001) Application of a stochastic name-passing calculus to representation and simulation of molecular processes. Information Processing Letters 80 25-31.
24. Sewell, P. (1998) From rewrite rules to bisimulation congruences. 9th International Conference on Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 1466 269-284.
25. (Full version to appear in Theoretical Computer Science 272.)