A concurrent graph semantics for mobile ambients

Electronic Notes in Theoretical Computer Science

Volumn 45, Issue , 2001, Pages 88-105

  Gadducci, Fabio ^a   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Concurrent graph rewriting; Graphical encoding of process calculi; Mobile ambients; Reduction semantics

Indexed keywords

ALGEBRA; CONCURRENT ENGINEERING; CONFORMAL MAPPING; ENCODING (SYMBOLS); GRAPH THEORY; MATHEMATICAL MODELS;

CONCURRENT GRAPH REWRITING; GRAPHICAL ENCODING PROCESS CALCULI; MOBILE AMBIENTS; REDUCTION SEMANTICS;

SEMANTICS;

EID: 0348186123     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)80957-5     Document Type: Conference Paper

References (27)

1. Baldan P., Corradini A., Ehrig H., Löwe M., Montanari U., Rossi F. Concurrent semantics of algebraic graph transformation. Ehrig H., Kreowski H.-J., Montanari U., Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation. volume 3:1999;107-187 World Scientific
2. Baldan P., Corradini A., Montanari U. An event structure semantics for P/T contextual nets: Asymmetric event structures. Nivat M. Foundations of Software Science and Computation Structures, volume 1378 of Lect. Notes in Comp. Science. 1998;63-80 Springer. Revised version to appear in Information and Computation
3. Barendregt H.P., van Eekelen M.C.J.D., Glauert J.R.W., Kennaway J.R., Plasmeijer M.J., Sleep M.R. Term graph reduction. de Bakker J.W., Nijman A.J., Treleaven P.C. Parallel Architectures and Languages Europe, volume 259 of Lect. Notes in Comp. Science. 1987;141-158 Springer
4. Berry G., Boudol G. The chemical abstract machine. Theoret. Comput. Sci. 96:1992;217-248
5. R. Bruni, F. Gadducci, and U. Montanari. Normal forms for algebras of connections. Theoret. Comput. Sci., 2001. To appear. Available at http://www.di.unipi.it/~ugo/tiles.html.
6. Cardelli L., Gordon A. Mobile ambients. Nivat M. Foundations of Software Science and Computation Structures, volume 1378 of Lect. Notes in Comp. Science. 1998;140-155 Springer
7. Corradini A., Gadducci F. An algebraic presentation of term graphs, via gs-monoidal categories. Applied Categorical Structures. 7:1999;299-331
8. Corradini A., Gadducci F. Rewriting on cyclic structures: Equivalence between the operational and the categorical description. Informatique Théorique et Applications/Theoretical Informatics and Applications. 33:1999;467-493
9. Corradini A., Montanari U., Rossi F., Ehrig H., Heckel R., Löwe M. Algebraic approaches to graph transformation I: Basic concepts and double pushout approach. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation. volume 1:1997;World Scientific
10. Drewes F., Habel A., Kreowski H.-J. Hyperedge replacement graph grammars. Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation. volume 1:1997;World Scientific
11. Ferrari G., Montanari U. Towards the unification of models for concurrency. Arnold A. Trees in Algebra and Programming, volume 431 of Lect. Notes in Comp. Science. 1990;162-176 Springer
12. Gadducci F., Heckel R., Llabrés M. A bi-categorical axiomatisation of concurrent graph rewriting. Hofmann M., Pavlović D., Rosolini G. Category Theory and Computer Science, volume 29 of Electronic Notes in Theoretical Computer Science. 1999;Elsevier Science. Available at http://www.elsevier.nl/locate/entcs/volume29.html/.
13. Gadducci F., Montanari U. Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoret. Comput. Sci. 2001;. To appear. Available at http://www.di.unipi.it/~ugo/tiles.html.
14. Gardner Ph. From process calculi to process frameworks. Palamidessi C. Concurrency Theory, volume 1877 of Lect. Notes in Comp. Science. 2000;69-88 Springer
15. Golz U., Reisig W. The non-sequential behaviour of Petri nets. Information and Control. 57:1983;125-147
16. M. Hasegawa. Models of Sharing Graphs. PhD thesis, University of Edinburgh, Department of Computer Science, 1997.
17. A. Jeffrey. Premonoidal categories and a graphical view of programs. Technical report, School of Cognitive and Computing Sciences, University of Sussex, 1997. Available at http://www.cogs.susx.ac.uk/users/alanje/premon/.
18. Joyal A., Nielsen M., Winskel G. Bisimulation from open maps. Information and Computation. 127:1996;164-185
19. A. Joyal, R.H. Street, and D. Verity. Traced monoidal categories. Mathematical Proceedings of the Cambridge Philosophical Society, 119:425-446, 1996.
20. Kahl W. The term graph programming system HOPS. Berghammer R., Lakhnech Y. Tool Support for System Specification, Development and Verification. Advances in Computing Science :1999;136-149 Springer. Tool available at http://ist.unibw-muenchen.de/kahl/HOPS/.
21. B. König. Description and Verification of Mobile Processes with Graph Rewriting Techniques. PhD thesis, Technische Universität München, 1999.
22. Levi F., Sangiorgi D. Controlling interference in ambients. Reps T. Principles of Programming Languages. 2000;352-364 ACM Press
23. R. Milner. Pi-nets: A graphical formalism. In D. Sannella, editor, European Symposium on Programming, volume 788 of Lect. Notes in Comp. Science, pages 26-42. Springer, 1995.
24. Milner R., Parrow J., Walker D. A calculus of mobile processes. Part I and II. Information and Computation. 100:1992;1-77
25. Montanari U., Pistore M. Concurrent semantics for the π-calculus. Brookes S., Main M., Melton A., Mislove M. Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Computer Science. 1995;Elsevier Science
26. Parrow J. Interaction diagrams. Nordic Journal of Computing. 2:1995;407-443
27. Yoshida N. Graph notation for concurrent combinators. Ito T., Yonezawa A. Theory and Practice of Parallel Programming, volume 907 of Lect. Notes in Comp. Science. 1994;393-412 Springer