Tile formats for located and mobile systems

Information and Computation

Volumn 156, Issue 1-2, 2000, Pages 173-235

  Ferrari, GianLuigi ^a   Montanari, Ugo ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; MOBILE TELECOMMUNICATION SYSTEMS;

STRUCTURAL OPERATIONAL SEMANTICS (SOS);

SEMANTICS;

EID: 0034627953     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1999.2825     Document Type: Article

References (63)

1. Aceto, L. (1994), Deriving complete inference systems for a class of GSOS languages generating regular behaviours, in "Proceedings CONCUR 94," Lect. Notes in Comput. Sci., Vol. 836, pp. 449-464, Springer-Verlag, Berlin.
2. Aceto, L., Bloom, B., and Vaandrager, F. (1992), Turning SOS rules into equations, Inform. and Comput. 111, 1-52.
3. Aceto, L., and Ingolfsdottir, A. (1995), CPO models for GSOS languages, Inform. and Comput. 129(2), 107-141.
4. Amadio, R., Castellani, I., and Sangiorgi, D. (1998), On bisimulations for the asynchronous π-calculus, Theoret. Comput. Sci. 195, 291-324.
5. Badouel, E., and Darondeau, P. (1995), Trace nets and process automata, Acta Inform. 32(7), 647-679.
6. Barendregt, H., van Eekelrn, M. C. J. D., Glauert, J. R. W., Kennaway, J., Plasmeijer, M. J., and Sleep, M. R. (1987), Term graph reduction, in "Proceedings PARLE," Lect. Notes in Comput. Sci., Vol. 259, pp. 141-158, Springer-Verlag, Berlin.
7. Baeten, J., and Verhoef, C. (1993), A congruence theorem for structured operational semantics with predicates, in "Proceedings CONCUR 93," Lect. Notes in Comput. Sci., Vol. 715, Springer-Verlag, Berlin.
8. Bernstein, K. (1998), A congruence theorem for structured operational semantics of higher-order languages, in "Proceedings 13th LICS Symposium," IEEE Press, New York.
9. Bloom, B. (1995), Structured operational semantics for weak bisimulations, Theoret. Comput. Sci. 146, 25-68.
10. Bloom, B., Istrail, S., and Meyer, A. R. (1995), Bisimulation can't be traced, J. Assoc. Comput. Mach. 42, 232-268.
11. Bloom, S., and Ésik, Z. (1993), "Iteration Theories," EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin.
12. Boudol, G. (1992), "Asynchrony and the π-Calculus (Note)," Rapport de Recherche 1702, INRIA, Sophia-Antipolis.
13. Boudol, G., Castellani, I., Hennessy, M., and Kiehn, A. (1993), Observing localities, Theoret. Comput. Sci. 114, 31-61.
14. Boudol, G., and Castellani, I. (1994), Flow models of distributed computations: Three equivalent semantics for CCS, Inform. and Comput. 114(2), 247-314.
15. Bruni, R., and Montanari, U. (1997), Zero-safe nets, or transition synchronization made simple, in "Proceedings EXPRESS '97," Electronic Notes in Theoretical Computer Science, Vol. 7, Elsevier, Amsterdam/New York.
16. Bruni, R., Gadducci, F., and Montanari, U. (1998), Normal forms for partitions and relations, abstract, in "Proceedings 13th Workshop on Algebraic Development Techniques," Lect. Notes in Comput. Sci., Vol. 1589, pp. 31-47.
17. Bruni, R., Meseguer, J., and Montanari, U. (1998), "Process and Term Tile Logic," Technical Report SRI-CSL-98-06, SRI International. [TR-98-09, Dipartimento di Informatica, University of Pisa]
18. Corradini, F., and De Nicola, R. (1994), Distribution and locality of concurrent systems, in "Proceedings ICALP '94," Lect. Notes in Comput. Sci., Vol. 920, Springer-Verlag, Berlin.
19. Corradini, A., Ehrig, H., Löwe, M., Montanari, U., and Rossi, F. (1997), Abstract approach to graph transformation. Part I. Basic concepts and double pushout approach, in "The Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1. Foundations" (G. Rozenberg, Ed.), World Scientific, Singapore.
20. Corradini, A., and Gadducci, F. (1998), An algebraic presentation of term graphs via Gs-monoidal categories, Appl. Categorical Struct., to appear.
21. Corradini, A., and Gadducci, F. (1997), A 2-categorical presentation of term graph rewriting, in "Proceedings CTCS 97," Lect. Notes in Comput. Sci., Vol. 1290, Springer-Verlag, Berlin.
22. Corradini, A., Gadducci, F., and Montanari, U. (1995), Relating two categorical models of term rewriting, in "Rewriting Techniques and Applications," Lect. Notes in Comput. Sci., Vol. 914, pp. 225-240.
23. Darondeau, P., and Degano, P. (1989), Causal trees, in "Proceedings ICALP '89," Lect. Notes in Comput. Sci., Vol. 372, Springer-Verlag, Berlin.
24. Degano, P., De Nicola, R., and Montanari, U. (1989), Partial ordering descriptions and observations of nondeterministic concurrent processes, in "Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency," Lect. Notes in Comput. Sci., Vol. 354, Springer-Verlag, Berlin.
25. Degano, P., Meseguer, J., and Montanari, U. (1996), Axiomatizing the algebra of net computations and processes, Acta Inform. 33(7), 641-667.
26. De Simone, R. (1995), Higher level synchronising devices in MEIJE-SCCS, Theoret. Comput. Sci. 37(3), 245-267.
27. Ehresmann, C. (1963), Catégories structurées, I, II, Ann. École Norm. Sup. Paris 80, 349-426;
28. Catégories structurées, I, II, III, Topol et Géom. Diff. V, Paris.
29. Ferrari, G., and Montanari, U. (1990), Towards the unification of models for concurrency, in "Proceedings, 15th Colloquium on Trees and Algebra of Programming (CAAP 90)," Lect. Notes in Comput. Sci., Vol. 431, pp. 162-176, Springer-Verlag, Berlin.
30. Ferrari, G., and Montanari, M. (1997), A tile-based coordination view of the asynchronous π-calculus, in "Proceedings MFCS 97," Lect. Notes in Comput. Sci., Vol. 1295, pp. 52-70, Springer-Verlag, Berlin.
31. Ferrari, G., and Montanari, M. (1997), Tiles for concurrent and located calculi, in "Proceedings EXPRESS 97," Electronic Notes in Theoretical Computer Science, Vol. 7, Elsevier, Amsterdam/ New York.
32. Gadducci, F. (1996), "On the Algebraic Approach to Concurrent Term Rewriting," Ph.D. thesis, Università di Pisa, Pisa. [Technical Report TD-96-02, Department of Computer Science, University of Pisa]
33. Gadducci, F., and Montanari, U. (1998), The tile model, in "Proofs, Languages and Interaction: Essays in Honour of Robin Milner" (G. Plotkin, C. Stirling, and M. Tofte, Eds.), MIT Press, Cambridge, MA.
34. Gadducci, F., and Montanari, U. (1996), Tiles, rewriting rules and CCS, in "Proceedings International Workshop on Rewriting Logic and Applications," Electronic Notes in Theoretical Computer Science, Vol. 4, pp. 1-19, Elsevier, Amsterdam/New York.
35. Gadducci, F., and Montanari, U. (1998), Axioms for contextual net processes, in "Proceedings ICALP'98," Lect. Notes in Comput. Sci., Vol. 1443, pp. 296-308, Springer-Verlag, Berlin.
36. Gorrieri, R., and Montanari, U. (1995), On the implementation of concurrent calculi into net calculi: Two case studies, Theoret. Comput. Sci. 141(1-2), 195-252.
37. Groote, J. F. (1990), Transition system specifications with negative premises, in "Proceedings CONCUR 90," Lect. Notes in Comput. Sci., Vol. 458, Springer-Verlag, Berlin.
38. Groote, J. F., and Vandraager, F. (1992), Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100, 202-260.
39. Hirsch, D., Inverardi, P., and Montanari, U. (1999), Graph grammars and constraint solving for software architecture styles, in "Proceedings Third International Software Architectures Workshop," E.E.U.U.
40. Hirsch, D., Inverardi, P., and Montanari, U. (1998), Modeling software architectures and styles with graph grammars and constraint solving, in "Proceedings First Working IFIP Conference on Software Architecture," E.E.U.U.
41. Honda, K., and Tokoro, M. (1992), An object calculus for asynchronous communication, in "Object-Based Concurrent Computing" (Tokoro, Nierstrass, and Wegner, Eds.), Lect. Notes in Comput. Sci., Vol. 612, pp. 21-51, Springer-Verlag, Berlin.
42. Kiehn, A. (1994), Local and global causes, Acta Inform. 31, 697-718.
43. Laneve, C., and Montanari, U. (1996), Axiomatizing permutation equivalence, Math. Struct. Comput. Sci. 6, 219-249.
44. Larsen, K., and Xinxin, L. (1991), Compositionality through an operational semantics of contexts, J. Logic Comput. 1(6).
45. Lawvere, F. W. (1963), Functorial semantics of algebraic theories, in "Proceedings National Academy of Science," Vol. 50, Washington, DC.
46. Meseguer, J. (1992), Conditional rewriting logic as a unified model of concurrency, Theoret. Comput. Sci. 96, 73-155.
47. Milner, R. (1989), "Communication and Concurrency," Prentice-Hall, Englewood Cliffs, NJ.
48. Milner, R., Parrow, J., and Walker, D. (1992), A calculus of mobile processes, I, II, Inform. and Comput. 100, 1-77.
49. Montanari, U., and Meseguer, J. (1998), Mapping tile logic into rewriting logic, in "Recent Trends in Algebraic Development Techniques" (F. Parisi-Presicce, Ed.), Lect. Notes in Comput. Sci., Vol. 1376, pp. 62-91, Springer-Verlag, Berlin.
50. Montanari, U., Pistore, M., and Yankelevich, D. (1996), Efficient minimization up to location equivalence, in "Proceedings ESOP 96," Lect. Notes in Comput. Sci., Vol. 1058, Springer-Verlag, Berlin.
51. Montanari, U., and Rossi, F. (1998), Graph rewriting, constraint solving and tiles for coordinating distributed systems, Appl. Category Theory, to appear.
52. Montanari, U., and Talcott, C. (1998), Can actors and π-agents live together?, in "Second Workshop on Higher-Order Operational Techniques in Semantics" (A. Gordon, A. Pitts, and C. Talcott, Eds.), Electronic Notes in Theoretical Computer Science, Vol. 10, Elsevier Press, Amsterdam/New York.
53. Montanari, U., and Yankelevich, D. (1995), Location equivalence in a parametric setting, Theoret. Comput. Sci. 149.
54. Parrow, J., and Victor, B. (1998), The τ-laws of fusion, in "Proceedings CONCUR'98," Lect. Notes in Comput. Sci., Vol. 1466, pp. 99-114.
55. Plotkin, G. (1981), "A Structural Approach to Operational Semantics," Technical Report DAIMI FN-19, Computer Science Department, Aarhus University.
56. Radestock, M., and Eisenbach, S. (1996), Semantics of higher order coordination languages, in "Proceedings COORDINATION'96," Lect. Notes in Comput. Sci., Vol. 1061, pp. 339-356, Springer-Verlag, Berlin.
57. Rensink, A. (1997), Bisimilarity of open terms, in "Proceedings EXPRESS 97," Electronic Notes in Theoretical Computer Science, Vol. 7, Elsevier Press, Amsterdam/New York.
58. Sangiorgi, S. (1992), "Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms," Ph.D. thesis CST-99-93, University of Edinburgh.
59. Sewell, P. (1998), From rewrite to bisimulation congruences, in "Proceedings CONCUR 98," Lect. Notes in Comput. Sci., Vol. 1466, pp. 269-284, Springer-Verlag, Berlin.
60. Thomsen, B. (1993), Plain chocs, Acta Inform. 30(1), 1-59.
61. Ulidowski, I. (1995), Axiomatisations of weak equivalences for De Simone languages, in "Proceedings CONCUR'95," Lect. Notes in Comput. Sci., Vol. 962, Springer-Verlag, Berlin.
62. Vaandrager, F. (1993), Expressiveness results for process algebras, in "Semantics: Foundations and Applications," Lect. Notes in Comput. Sci., Vol. 666, Springer-Verlag, Berlin.
63. Walker, D. (1995), Ojects in the π-calculus, Inform. and Comput. 116(2), 252-271.