Advertisement

Network Applications of Graph Bisimulation

  • Pietro Cenciarelli
  • Daniele Gorla
  • Emilio Tuosto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5214)

Abstract

Synchronising Graphs is a system of parallel graph transformation designed for modeling process interaction in a network environment. We propose a theory of context-free synchronising graphs and a novel notion of bisimulation equivalence which is shown to be a congruence with respect to graph composition and node restriction. We use this notion of equivalence to study some sample network applications, and show that our bisimulation equivalence captures notions like functional equivalence of logical switches, equivalence of channel implementations and level of fault tolerance of a network.

Keywords

Operational Semantic Abstract Graph Network Application Service Node Process Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bonchi, F., König, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS, pp. 69–80. IEEE, Los Alamitos (2006)Google Scholar
  2. 2.
    Cardelli, L., Gordon, A.: Mobile Ambients. Theor. Comp. Science 1(240), 177–213 (2000)CrossRefMathSciNetGoogle Scholar
  3. 3.
    Cenciarelli, P., Talamo, I., Tiberi, A.: Ambient Graph Rewriting. Electronic Notes in Theoretical Computer Science 117, 335–351 (2005)CrossRefGoogle Scholar
  4. 4.
    Cenciarelli, P., Tiberi, A.: Rational Unification in 28 Characters. Electronic Notes in Theoretical Computer Science 127(5), 3–20 (2005)CrossRefGoogle Scholar
  5. 5.
    Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: A semantics-based tool for the verification of concurrent systems. ACM ToPLaS 15(1), 36–72 (1993)CrossRefGoogle Scholar
  6. 6.
    Cormen, T., Leiserson, C., Rivest, R.: Introduction to algorithms. MIT Press, Cambridge (1990)Google Scholar
  7. 7.
    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. In: Handbook of Graph Grammars and Computing by Graph Transformation, ch. 3, vol. 1Google Scholar
  8. 8.
    Degano, P., Montanari, U.: A model for distributed systems based on graph rewriting. Journal of the ACM 34, 411–449 (1987)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Ehrig, H., König, B.: Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 151–166. Springer, Heidelberg (2004)Google Scholar
  10. 10.
    Ferrari, G., Montanari, U., Tuosto, E.: A LTS semantics of ambients via graph synchronization with mobility. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Ferrari, G., Montanari, U., Tuosto, E.: Model Checking for Nominal Calculi. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 1–24. Springer, Heidelberg (2005)Google Scholar
  12. 12.
    Hirsch, D., Montanari, U.: Synchronized hyperedge replacement with name mobility: A graphical calculus for name mobility. In: Agha, G.A., De Cindio, F., Rozenberg, G. (eds.) APN 2001. LNCS, vol. 2001. Springer, Heidelberg (2001)Google Scholar
  13. 13.
    König, B., Montanari, U.: Observational equivalence for synchronized graph rewriting with mobility. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol. 2215, pp. 145–164. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Lanese, I.: Synchronization Strategies for Global Computing Models. PhD thesis, Univ. of Pisa (2006)Google Scholar
  15. 15.
    Lanese, I., Montanari, U.: A graphical fusion calculus. In: Proc. of COMETA 2003 (2003)Google Scholar
  16. 16.
    Leifer, J.: Operational Congruences for Reactive Systems. PhD thesis, Univ. of Cambridge (UK) (2001)Google Scholar
  17. 17.
    Leifer, J., Milner, R.: Deriving Bisimulation Congruences for Reactive Systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243–258. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  18. 18.
    Milner, R.: Bigraphical Reactive Systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  19. 19.
    Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Information and Computation 100, 1–77 (1992)MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Montanari, U., Buscemi, M.: A First Order Coalgebraic Model of π-Calculus Early Observational Equivalence. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 449–465. Springer, Heidelberg (2002)Google Scholar
  21. 21.
    Parrow, J., Victor, B.: The fusion calculus: Expressiveness and symmetry in mobile processes. In: Proc.of LICS. IEEE Computer Society Press, Los Alamitos (1998)Google Scholar
  22. 22.
    Riely, J., Hennessy, M.: Distributed Processes and Location Failures. Theoretical Computer Science 266, 693–735 (2001)MATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: Proc. of LICS. IEEE Computer Society Press, Los Alamitos (1997)Google Scholar
  24. 24.
    Warneke, B., Last, M., Liebowitz, B., Pister, K.S.J.: Smart dust: Communicating with a cubic-millimeter computer. IEEE Computer 34(1), 44–51 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Pietro Cenciarelli
    • 1
  • Daniele Gorla
    • 1
  • Emilio Tuosto
    • 2
  1. 1.Dip. di Informatica“Sapienza” Università di RomaItaly
  2. 2.Dept. Computer ScienceUniverity of LeicesterUK

Personalised recommendations