On Graph(ic) Encodings

Dagstuhl Seminar Proceedings

Volumn 4241, Issue , 2005, Pages

  Bruni, Roberto ^a   Lanese, Ivan ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); INTEGRATED CIRCUITS;

BIGRAPHS; ENCODING TECHNIQUES; ENCODINGS; INTERACTIVE SYSTEM; MODELLING SYSTEMS; PROCESS CALCULI; REPLACEMENT SYSTEMS; SYNCHRONIZED HYPEREDGE REPLACEMENT; TERM GRAPHS; TILE MODELS;

TIMING CIRCUITS;

EID: 84908176692     PISSN: 18624405     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (54)

1. M. Abadi and A.D. Gordon. A calculus for cryptographic protocols: The spi calculus. Inform. and Comput., 148(1):1–70, 1999.
2. A. Asperti and S. Guerrini. The Optimal Implementation of Functional Programming Languages, volume 45 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1998.
3. 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.
4. M. Boreale, M. Buscemi, and U. Montanari. D-fusion: a distinctive fusion calculus. In W.N. Chin, editor, Proceedings of APLAS 2004, 2nd Asian Symposium on Programming Languages and Systems, volume 3302 of Lect. Notes in Comput. Sci., pages 296–310. Springer Verlag, 2004.
5. R. Bruni. Tile Logic for Synchronized Rewriting of Concurrent Systems. PhD thesis, Computer Science Department, University of Pisa, 1999.
6. R. Bruni, J.L. Fiadeiro, I. Lanese, A. Lopes, and U. Montanari. New insights on architectural connectors. In J.-J. Levy, E.W. Mayr, and J.C. Mitchell, editors, Proceedings of IFIP TCS 2004, 3rd IFIP International Conference on Theoretical Computer Science, IFIP Conference Proceedings, pages 367–379. Kluwer Academics, 2004.
7. R. Bruni, F. Honsell, M. Lenisa, and M. Miculan. Comparing higher-order encodings in logical frameworks and tile logic. In U. Montanari, editor, Proceedings of TOSCA 2001, Final Workshop of the TOSCA Project, volume 62 of Elect. Notes in Th. Comput. Sci., 2001.
8. R. Bruni and U. Montanari. Cartesian closed double categories, their lambda-notation, and the pi-calculus. In Proceedings of LICS’99, 14th Annual IEEE Symposium on Logic in Computer Science, pages 246–265. IEEE Computer Society Press, 1999.
9. L. Cardelli and A.D. Gordon. Mobile ambients. In M. Nivat, editor, Proceedings of FoSSaCS’98, Foundations of Software Science and Computational Structures, volume 1378 of Lect. Notes in Comput. Sci., pages 140–155. Springer Verlag, 1998.
10. K. Chandy and J. Misra. Parallel Program Design - A Foundation. Addison-Wesley, 1988.
11. A. Corradini and F. Gadducci. An algebraic presentation of term graphs, via gs-monoidal categories. Applied Categorical Structures, 7:299–331, 1999.
12. A. Corradini and U. Montanari. An algebraic semantics for structured transition systems and its application to logic programs. Theoret. Comput. Sci., 103:51–106, 1992.
13. R. De Nicola, G.L. Ferrari, and R. Pugliese. KLAIM: a kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering, 24(5):315–330, 1998.
14. P. Degano and U. Montanari. A model for distributed systems based on graph rewriting. Journal of the ACM (JACM), 34(2):411–449, 1987.
15. G.L. Ferrari and U. Montanari. Tile formats for located and mobile systems. Inform. and Comput., 156(1-2):173–235, 2000.
16. G.L. Ferrari, U. Montanari, and E. Tuosto. A LTS semantics of ambients via graph synchronization with mobility. In A. Restivo, S. Ronchi Della Rocca, and L. Roversi, editors, Proceedings of ICTCS 2001, 7th Italian Conference on Theoretical Computer Science, volume 2202 of Lect. Notes in Comput. Sci., pages 1–16. Springer Verlag, 2001.
17. J.L. Fiadeiro and T. Maibaum. Categorical semantics of parallel program design. Science of Computer Programming, 28:111–138, 1997.
18. F. Gadducci. Term graph rewriting for the π-calculus. In A. Ohori, editor, Proceedings of APLAS 2003, 1st Asian Symposium on Programming Languages and Systems, volume 2895 of Lect. Notes in Comput. Sci., pages 37–54. Springer Verlag, 2003.
19. F. Gadducci and U. Montanari. The tile model. In G. Plotkin, C. Stirling, and M. Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, pages 133–166. MIT Press, 2000.
20. F. Gadducci and U. Montanari. A concurrent graph semantics for mobile ambients. In Proceedings of MFPS 2001, 17th Conference on the Mathematical Foundations of Programming Semantics, volume 45 of Elect. Notes in Th. Comput. Sci. Elsevier Science, 2001.
21. F. Gadducci and U. Montanari. Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoret. Comput. Sci., 285(2):319–358, 2002.
22. P. Gardner. From process calculi to process frameworks. In C. Palamidessi, editor, Proceeding of CONCUR 2000, 11th International Conference on Concurrency Theory, volume 1877 of Lect. Notes in Comput. Sci., pages 69–88. Springer Verlag, 2000.
23. J. Goguen. Categorical foundations for general systems theory. In F. Pichler and R. Trappl, editors, Advances in Cybernetics and Systems Research, pages 121–130. Transcripta Books, 1973.
24. M. Hasegawa. Models of sharing graphs. PhD thesis, University of Edinburgh, Department of Computer Science, 1997.
25. D. Hirsch, P. Inverardi, and U. Montanari. Reconfiguration of software architecture styles with name mobility. In A. Porto and G.-C. Roman, editors, Proceedings of Coordination 2000, 4th International Conference on Coordination Languages and Models, volume 1906 of Lect. Notes in Comput. Sci., pages 148–163. Springer Verlag, 2000.
26. D. Hirsch and U. Montanari. Synchronized hyperedge replacement with name mobility. In K.G. Larsen and M. Nielsen, editors, Proceedings of CONCUR 2001, 12th International Conference on Concurrency Theory, volume 2154 of Lect. Notes in Comput. Sci., pages 121–136. Springer Verlag, 2001.
27. K. Honda and M. Tokoro. An object calculus for asynchronous communication. In P. America, editor, Proceedings of ECOOP’91, European Conference on Object-Oriented Programming, volume 512 of Lect. Notes in Comput. Sci., pages 133–147. Springer Verlag, 1991.
28. O.H. Jensen and R. Milner. Bigraphs and transitions. SIGPLAN Not., 38(1):38–49, 2003.
29. O.H. Jensen and R. Milner. Bigraphs and mobile processes (revised). Technical Report TR580, Cambridge Computer Laboratory, 2004.
30. B. König. A graph rewriting semantics for the polyadic π-calculus. In J.D.P. Rolim, A.Z. Broder, A. Corradini, R. Gorrieri, R. Heckel, J. Hromkovic, U. Vaccaro, and J.B. Wells, editors, Proceedings of ICALP Workshops 2000: GT-VMT 2000, Satellite Workshop on Graph Transformation and Visual Modeling Techniques, volume 8 of Proceedings in Informatics, pages 451–458. Carleton Scientific, 2000.
31. J. Lamping. An algorithm for optimal lambda calculus reduction. In Proceedings of POPL’90, 17th Annual ACM Symposium on Principles of Programming Languages, pages 16–30. Association for Computing Machinery, 1990.
32. I. Lanese and U. Montanari. A graphical fusion calculus. In F. Honsell, M. Lenisa, and M. Miculan, editors, Proceedings of CoMeta 2003, Final Workshop of the CoMeta Project, Elect. Notes in Th. Comput. Sci., 2003. To appear.
33. I. Lanese and U. Montanari. Synchronization algebras with mobility for graph transformations. In J. Rathke, editor, Proceedings of FGUC 2004, Satellite Workshop of CONCUR 2004 on Foundations of Global Ubiquitous Computing, Elect. Notes in Th. Comput. Sci., 2004. To appear.
34. C. Laneve, J. Parrow, and B. Victor. Solo diagrams. In N. Kobayashi and B.C. Pierce, editors, Proceedings of TACS 2001, 4th International Symposium on Theoretical Aspects of Computer Software, volume 2215 of Lect. Notes in Comput. Sci., pages 127–144. Springer Verlag, 2001.
35. C. Laneve and B. Victor. Solos in concert. Math. Struct. in Comput. Sci., 13(5):657–683, 2003.
36. K.G. Larsen and L. Xinxin. Compositionality through an operational semantics of contexts. In M.S. Paterson, editor, Proceedings of ICALP’90, 17th International Colloquium on Automata, Languages and Programming, volume 443 of Lect. Notes in Comput. Sci., pages 526–539. Springer Verlag, 1990.
37. J.J. Leifer and R. Milner. Deriving bisimulation congruences for reactive systems. In C. Palamidessi, editor, Proceedings of CONCUR 2000, 11th International Conference on Concurrency Theory, volume 1877 of Lect. Notes in Comput. Sci., pages 243–258. Springer Verlag, 2000.
38. J.-J. Lévy. Optimal reductions in the lambda-calculus. In J.P. Seldin and J.R. Hindley, editors, To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 159–191. Academic Press, 1980.
39. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Theoret. Comput. Sci., 96:73–155, 1992.
40. R. Milner. Communication and concurrency. Prenctice Hall, 1989.
41. R. Milner. Pi-nets: A graphical formalism. In D. Sannella, editor, Proceedings of ESOP’94, European Symposium on Programming, volume 788 of Lect. Notes in Comput. Sci., pages 26–42. Springer Verlag, 1994.
42. R. Milner. Bigraphical reactive systems. In K.G. Larsen and M. Nielsen, editors, Proceedings of CONCUR 2001, 12th International Conference on Concurrency Theory, volume 2154 of Lect. Notes in Comput. Sci., pages 16–35. Springer Verlag, 2001.
43. R. Milner, J. Parrow, and J. Walker. A calculus of mobile processes, I and II. Inform. and Comput., 100(1):1–40,41–77, 1992.
44. U. Montanari and M. Pistore. Concurrent semantics for the pi-calculus. In Proceedings of MFPS 1995, 11th Conference on the Mathematical Foundations of Programming Semantics, volume 1 of Elect. Notes in Th. Comput. Sci. Elsevier Science, 1995.
45. J. Parrow. Interaction diagrams. Nordic Journal of Computing, 2(2):407–443, 1995.
46. J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In Proceedings of LICS’98, 13th Annual Symposium on Logic in Computer Science, pages 176–185. IEEE Computer Society Press, 1998.
47. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981.
48. 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.
49. A. Rensink. Bisimilarity of open terms. Inform. and Comput., 156(1-2):345–385, 2000.
50. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, LFCS, University of Edinburgh, 1993. CST-99-93 (also published as ECS-LFCS-93-266).
51. P. Sewell. From rewrite rules to bisimulation congruences. In D. Sangiorgi and R. de Simone, editors, Proceedings of CONCUR’98, 9th International Conference on Concurrency Theory, volume 1466 of Lect. Notes in Comput. Sci., pages 269–284. Springer Verlag, 1998.
52. G. Stefanescu. Interactive systems: from a natural language expression, to a mathematical concept. In H.C.M. de Swart, editor, Proceedings of RELMICS 2001, 6th International Workshop on Relational Methods in Computer Science, volume 2561 of Lect. Notes in Comput. Sci., pages 197–211. Springer Verlag, 2001.
53. G. Stefanescu. Interactive systems with registers and voices. Draft available at http://www.comp.nus.edu.sg/~gheorghe/papers/rvsystems.pdf, 2004.
54. N. Yoshida. Graph notation for concurrent combinators. In T. Ito and A. Yonezawa, editors, Proceedings of TPPP’94, International Workshop on Theory and Practice of Parallel Programming, volume 907 of Lect. Notes in Comput. Sci., pages 393–412. Springer Verlag, 1995.