Bigraphs and transitions

ACM SIGPLAN Notices

Volumn 38, Issue 1, 2003, Pages 38-49

  Jensen, Ole Høgh ^a   Milner, Robin ^b  

^a AALBORG UNIVERSITY   (Denmark)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Bigraph; Bisimilarity; Mobile computation; Reactive system; Transition system; calculus

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; MATHEMATICAL MODELS; SEMANTICS;

CIRCLES; CONGRUENCE; LABELLED TRANSITION SYSTEM; RECONFIGURABLE SPACE;

GRAPH THEORY;

EID: 1442314601     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/640128.604135     Document Type: Article

References (27)

1. Berry, G. and Boudol, G. (1992), The chemical abstract machine. Journal of Theoretical Computer Science, Vol. 96, pp217-248.
2. Boudol, G. (1992), Asynchrony and the π-calculus. Rapport de Recherche RR-1702, INRIA Sophia-Antipolis.
3. Cardelli, L. and Gordon, A.D. (2000), Mobile ambients. Foundations of System Specification and Computational Structures, LNCS 1378, pp140-155.
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. [Submitted for publication.] Available at http://pauillac.inria.fr/~leifer
5. Drewes, F., Hoffmann, B. and Plump, D. (2000) Hierarchical graph transformation. In: Foundations of Software Science and Computation Structures, LNCS 1784, Springer Verlag.
6. Ehrig, H. (1979) Introduction to the theory of graph grammars. Graph Grammars and their Application to Computer Science and Biology, LNCS 73, Springer Verlag, pp1-69.
7. Ehrig, H. (2002) Bigraphs meet double pushouts. EATCS Bulletin 78, October 2002, pp72-85.
8. Gardner, P.A. (2000), From process calculi to process frameworks. Proc. CONCUR 2000, 11th International Conference on Concurrency Theory, pp69-88.
9. Gardner, P.A. and Wischik, L. (2000) Explicit fusions. Proc. MFCS 2000. LNCS 1893, pp373-383.
10. Gadducci, F. and Heckel, R. (1998) An inductive view of graph transformation. Recent Trends in Algebraic Development Techniques, LNCS 1376, Springer Verlag, pp223-237.
11. Hirsch, D. and Montanari, U. (2001) Synchronized hyperedge replacement with name mobility. CONCUR 2001, Proc. 12th International Conference in Concurrency Theory, LNCS 2154, 2001, pp121-136.
12. Honda, K and Tokoro, M. (1992) On asynchronous communication semantics. Object-based Concurrent Computing, LNCS 612, Springer Verlag.
13. Leifer, J. J. (2001), Operational congruences for reactive systems. PhD Dissertation, University of Cambridge Computer Laboratory. Distributed in revised from as Technical Report 521. Available from http://pauillac.inria.fr/~leifer
14. Jeusen O.H. and Milner, R. (2000), Bigraphs and process calculi. To appear as a Technical Report, University of Cambridge Computer Laboratory (2000). Deriving bisimulation
15. Leifer, J.J. and Milner, R. (2000). Deriving bisimulation congruences for reactive systems. Proc. CONCUR 2000, 11th International Conference on Concurrency theory, pp243-258. Available at http://pauillac.inria.fr/~leifer.
16. Milner, R. (1996) Calculi for interaction. Acta Informatica 33, pp707-737.
17. Milner, R. (1999), Communicating and mobile systems: the π-calculus. Cambridge University Press.
18. Milner, R. (2001), Bigraphical reactive systems. CONCUR 2001, Proc. 12th International Conference in Concurrency Theory, LNCS 2154, 2001, pp16-35.
19. Milner, R. Bigraphical reactive systems: basic theory. Technical Report 503, University of Cambridge Computer Laboratory (2001). Available from http://www.cl.cam.ac.uk/~rm135.
20. Milner, R.; Parrow, J. and Walker D. (1992), A calculus of mobile processes, Parts I and II. Journal of Information and Computation, Vol 100, pp1-40, and pp41-77.
21. Milner, R. and Sangiorgi, D. (1992), Barbed bisimulation. In: International Conference on Automata, Languages and Programming, LNCS 623, Springer Verlag.
22. Park, D. M. R. (1980), Concurrency and automata on infinite sequences. LNCS 104, Springer Verlag.
23. Parrow, J. and Victor, B. (1998), The fusion calculus: expressiveness and symmetry in mobile processes. Proc. LICS'98, IEEE Computer Society Press.
24. Sangiorgi, D. and Walker, D. (2001), The π-calculus: A Theory of Mobile Processes. Cambridge University Press.
25. Sassone, V. and Sobocinski, P. (2002), Deriving bisimulation congruences: a 2-categorical approach. Electronic Notes in Theoretical Computer Science, Vol. 68 (2), 19pp.
26. Sewell, P. (2002), From rewrite rules to bisimulation congruences. Theoretical Computer Science, Vol. 274(1-2), pp183-230.
27. Wojciechowski, P.T. and Sewell, P. (1999), Nomadic Pict: Language and infrastructure design for mobile agents. Proc. ASA/MA '99, Palm Springs, California.