Observing reductions in nominal calculi Via a graphical encoding of processes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3838 LNCS, Issue , 2005, Pages 106-126

  Gadducci, Fabio ^a   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

Graph transformations; Nominal calculi; Reduction semantics; Relative pushouts; Synthesised labelled transition systems

Indexed keywords

CONFORMAL MAPPING; DIFFERENTIATION (CALCULUS); EQUIVALENCE CLASSES; GRAPH THEORY; SEMANTICS; STATE SPACE METHODS;

GRAPH TRANSFORMATIONS; NOMINAL CALCULI; REDUCTION SEMANTICS; RELATIVE PUSHOUTS; SYNTHESISED LABELLED TRANSITION SYSTEMS;

ENCODING (SYMBOLS);

EID: 33750262461     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11601548_9     Document Type: Article

References (24)

1. P. Baldan, A. Corradini, H. Ehrig, M. Löwe, U. Montanari, and F. Rossi. Concurrent semantics of algebraic graph transformation. In H. Ehrig, H.-J. Kreowski, U. Montanari, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 3, pages 107-187. World Scientific, 1999.
2. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, and M.R. Sleep. Term graph reduction. In J.W. de Bakker, A.J. Nijman, and P.C. Treleaven, editors, Parallel Architectures and Languages Europe, volume 259 of Led. Notes in Comp. Sci., pages 141-158. Springer, 1987.
3. M. Barr and C. Wells. Category Theory for Computing Science. Les Publications CMR, 1999.
4. G. Berry and G. Boudol. The chemical abstract machine. Theor. Comp. Sci., 96:217-248, 1992.
5. A. Corradini and F. Gadducci. An algebraic presentation of term graphs, via gs-monoidal categories. Applied Categorical Structures, 7:299-331, 1999.
6. H. Ehrig, A. Habel, J. Padberg, and U. Prange. Adhesive high-level replacement categories and systems. In G. Engels and F. Parisi-Presicce, editors, Graph Transformation, Lect. Notes in Comp. Sci. Springer, 2004.
7. J. Engelfriet and T. Gelsema. Multisets and structural congruence of the πcalculus with replication. Theor. Comp. Sci., 211:311-337, 1999.
8. F. Gadducci. Term graph rewriting and the π-calculus. In A. Ohori, editor, Programming Languages and Semantics, volume 2895 of Lect. Notes in Comp. Sci., pages 37-54. Springer, 2003.
9. F. Gadducci and R. Heckel. An inductive view of graph transformation. In F. Parisi-Presicce, editor, Recent Trends in Algebraic Development Techniques, volume 1376 of Lect. Notes in Comp. Sci., pages 219-233. Springer, 1997.
10. F. Gadducci, R. Heckel, and M. Llabrés. A bi-categorical axiomatisation of concurrent graph rewriting. In M. Hofmann, D. Pavlovic̀, and G. Rosolini, editors, Category Theory and Computer Science, volume 29 of Electr. Notes in Theor. Comp. Sci. Elsevier Science, 1999.
11. F. Gadducci and U. Montanari. A concurrent graph semantics for mobile ambients. In S. Brookes and M. Mislove, editors, Mathematical Foundations of Programming Semantics, volume 45 of Electr. Notes in Theor. Comp. Sci. Elsevier Science, 2001.
12. F. Gadducci and U. Montanari. Graph processes with fusions: concurrency by colimits, again. In H.-J. Kreowski et al., editor, Formal Methods (Ehrig Festschrift), volume 3393 of Lect. Notes in Comp. Sci., pages 84-100. Springer, 2005.
13. M. Hasegawa. Models of Sharing Graphs. PhD thesis, University of Edinburgh, Department of Computer Science, 1997.
14. A. Jeffrey. Premonoidal categories and a graphical view of programs. Technical report, School of Cognitive and Computing Sciences, University of Sussex, 1997.
15. S. Lack and P. Sobociński. Adhesive and quasiadhesive categories. Informatique Théorique et Applications/Theoretical Informatics and Applications, 39:511-545, 2005.
16. J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In C. Palamidessi, editor, Concurrency Theory, volume 1877 of Lect. Notes in Comp. Sci., pages 243-258. Springer, 2000.
17. J.-J. Levy. Optimal reductions in the lambda-calculus. In J.P. Seldin and J.R. Hindley, editors, Combinatory Logic, Lambda Calculus and Formalism: Essays in honour of Haskell B. Curry, pages 159-191. Academic Press, 1980.
18. R. Milner. The polyadic π-calculus: A tutorial. In F.L. Bauer, W. Brauer, and H. Schwichtenberg, editors, Logic and Algebra of Specification, volume 94 of Nato ASI Series F, pages 203-246. Springer, 1993.
19. R. Milner. Bigraphical reactive systems. In K.G. Larsen and M. Nielsen, editors, Concurrency Theory, volume 2154 of Lect. Notes in Comp. Sci., pages 16-35. Springer, 2001.
20. D. Plump. Term graph rewriting. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Handbook of Graph Grammars and Computing by Graph Transformation, volume 2, pages 3-61. World Scientific, 1999.
21. S. Sangiorgi and D. Walker. The n-calculus: A Theory of Mobile Processes. Cambridge University Press, 2001.
22. V. Sassone and P. Sobociński. Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing, 10:163-183, 2003.
23. V. Sassone and P. Sobociński. Reactive systems over cospans. In Logic in Computer Science, pages 311-320. IEEE Computer Society Press, 2005.
24. P. Sewell. From rewrite rules to bisimulation congruences. Theor. Comp. Sci., 274:183-230, 2004.