Bigraphs and Their Algebra

Electronic Notes in Theoretical Computer Science

Volumn 209, Issue C, 2008, Pages 5-19

  Milner, Robin ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Bigraphs; Process Calculi

Indexed keywords

ALGEBRA; MATHEMATICAL MODELS; PROBLEM SOLVING;

BIGRAPHS; ELEMENTARY CATEGORY THEORY; PROCESS CALCULI;

GRAPH THEORY;

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

References (30)

1. Birkedal L., Damgaard C.D., Glenstrup A.J., and Milner R. Matching of bigraphs. Proc. Workshop in Graph Transformation for Verification and Concurrency. Electronic Notes in Theoretical Computer Science (2006) Elsevier
2. Birkedal, L. and Hildebrandt, T. (2004), Bigraphical programming languages. Laboratory for Context-Dependent Mobile Communication, IT University, Denmark. http://www.LaCoMoCo.itu.dk
3. 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, pp1-12
4. 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
5. Clavel M., Eker S., Lincoln P., and Meseguer J. Priniciples of Maude. In: Meseguer J. (Ed). Proc. First International Workshop on Rewriting Logic and ite Applications. Electronic Notes in Theoretical Computer Science 4 (1996) Elsevier
6. Conforti, G., Macedonio, D. and Sassone, V. (2005), Spatial logics for bigraphs. In: International Conference on Automata, Languages and Programming, pp766-778
7. Conforti, G., Macedonio, D. and Sassone, V. (2005), Bigraphical Logics for XML. In: Proc. 13th Italian Symposium on Advanced Datebase Systems (SEBD), pp392-399
8. Damgaard C.D., and Birkedal L. Axiomatizing binding bigraphs. Nordic Journal of Computing 13 1-2 (2006) 58-77
9. Danos, V., Feret, J., Fontana, W. and Krivine, J. (2007), Scalable modelling of biological pathways. In: Z. Shao (ed.), Proceedings of APLAS, 4807, pp139-157
10. Ehrig H. Introduction to the theory of graph grammars. Graph Grammars and their Application to Computer Science and Biology. LNCS 73 (1979), Springer Verlag 1-69
11. Ehrig H. Bigraphs meet double pushouts. EATCS Bulletin 78 (October 2002) 72-85
12. Gadducci F., Heckel R., and Llabrés Segura M. A bi-categorical axiomatisation of concurrent graph rewriting. Proc. 8th Conference on Category Theory in Computer Science. (CTCS). Electronic Notes in TCS 29 (1999) Elsevier Science
13. Gadducci F., and Montanari U. The tile model. In: Plotkin G., Stirling C., and Tofte M. (Eds). Proof, Language and interaction (2000), MIT Press 133-166
14. Hildebrandt T., Niss H., and Olsen M. Formalising business process execution with bigraphs and reactive XML. Proc. 8th International Conference on Coordination Models and Languages. LNCS 4038 (2006), Springer Verlag 113-129
15. Hirsch D., and Montanari U. Synchronised hyperedge replacement with name mobility. Proc. 12th International Conference on Concurrency Theory. (CONCUR). LNCS 2154 (2001) 121-136
16. Jensen, O.H. (2005), Forthcoming PhD Dissertation
17. Jensen, O.H. and Milner, R. (2003), Bigraphs and transitions. In: 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages
18. Jensen, O.H. and Milner, R. (2004), Bigraphs and mobile processes (revised). Technical Report UCAM-CL-TR-580, University of Cambridge Computer Laboratory
19. Krivine, J., Milner, R. and Troina, A. (2007), Stochastic bigraphs. Submitted for publication (17pp)
20. 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
21. Leifer, J.J. and Milner, R. (2000), Deriving bisimulation congruences for reactive systems. In: Proc. CONCUR 2000, 11th International Conference on Concurrency Theory, pp243-258. Available at http://pauillac.inria.fr/~leifer
22. Leifer J.J., and Milner R. Transition systems, link graphs and Petri nets. Mathematical Structures in Computer Science 16 (2004) 989-1047
23. Meseguer J. Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science 96 (1992) 73-155
24. Milner R. Calculi for interaction. Acta Informatica 33 (1996) 707-737
25. Milner R. Bigraphical reactive systems. Proc. 12th International Conference on Concurrency Theory. LNCS 2154 (2001) 16-35
26. Milner R. Axioms for bigraphical structure. Mathematical Structures in Computer Science 15 (2005) 1005-1032
27. Milner R. Pure bigraphs: Structure and dynamics. Information and Computation 204 (2006) 60-122
28. 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, pp459-470
29. Sassone V., and Sobocinski P. Deriving bisimulation congruences: a 2-categorical approach. Electronic Notes in Theoretical Computer Science 68 2 (2002) 19
30. Terese. Term Rewriting Systems (2003), Cambridge University Press