Graph-Based Models of Internetworking Systems

  • Gianluigi Ferrari
  • Ugo Montanari
  • Emilio Tuosto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2757)


Graphical notations have been widely accepted as an expressive and intuitive working tool for system specification and design. This paper outlines a declarative approach based on (hyper-)graphs and graph synchronization to deal with the modeling of Wide Area Network applications. This paper aims at contributing to the understanding of crucial issues involved in the specification and design of Wide Area Network systems, as a first step toward the development of software engineering techniques and tools for designing and certificating internetworking systems.


Mobile Agent State Diagram Graph Transformation Wide Area Network Free Node 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abadi, M., Gordon, A.: A calculus for cryptographic protocols: The spi calculus. Information and Computation 148(1), 1–70 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Andrade, L., Fiadeiro, J.L.: Coordination for orchestration. In: Arbab, F., Talcott, C. (eds.) COORDINATION 2002. LNCS, vol. 2315, p. 5. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  3. 3.
    Angin, O., Campbell, A., Kounavis, M., Liao, R.: The Mobiware Toolkit: Programmable Support for Adaptive Mobile Networking. In: IEEE Personal Communications Magazine (August 1998)Google Scholar
  4. 4.
    Bettini, L., De Nicola, R., Ferrari, G., Pugliese, R.: Interactive Mobile Agents in X-Klaim. In: Proc. of the 7th Int. IEEE Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE), pp. 110–115 (1998)Google Scholar
  5. 5.
    Blake, S., Black, D., Carlson, M., Davies, E., Weiss, W.: An architecture for differentiated services. Technical Report RFC 2475 (1998)Google Scholar
  6. 6.
    Booch, G., Rumbaugh, J., Jacobson, I.: The Unified Modeling Language User Guide. Addison-Wesley, Reading (1998)Google Scholar
  7. 7.
    Braden, R., Zhang, L., Berson, S., Herzog, S., Jamin, S.: Resource reservation protocol (rsvp) - version 1 functional specificationGoogle Scholar
  8. 8.
    Bruni, R., Laneve, C., Montanari, U.: Orchestrating Transactions in Join Calculus. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 321. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  9. 9.
    Bugliesi, M., Castagna, G., Crafa, S.: Reasoning about Security in Mobile Ambients. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 102–120. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Caires, L., Cardelli, L.: A spatial logic for concurrency (part II). In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, p. 209. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Cardelli, L., Gordon, A.D.: Mobile Ambients. FOSSACS 1998 240, 177–213 (2000); An extended abstract appeared in Nivat, M. (ed.): FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)Google Scholar
  12. 12.
    Cardelli, L., Gordon, A.: Anytime, anywhere — modal logics for mobile ambients. In: Proceedings of POPL 2000, pp. 365–377. ACM Press, New York (2000)Google Scholar
  13. 13.
    Castagna, G., Ghelli, G., Zappa Nardelli, F.: Typing mobility in the seal calculus. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 82–101. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Castagna, G., Vitek, J.: Seal: A Framework for Secure Mobile Computations. In: Bal, H.E., Cardelli, L., Belkhouche, B. (eds.) ICCL-WS 1998. LNCS, vol. 1686, pp. 47–77. Springer, Heidelberg (1999)Google Scholar
  15. 15.
    Cinciarone, G., Corson, M., Macker, J.: Internet-based mobile ad hoc networking. Internet Computing 3(4) (1999)Google Scholar
  16. 16.
    Clarke, E.M., Jha, S., Marrero, W.: Using state space exploration and a natural deduction style message derivation engine to verify security protocols. In: IFIPWorking Conference on Programming Concepts and Methods, PROCOMET (1998)Google Scholar
  17. 17.
    De Nicola, R., Ferrari, G., Montanari, U., Pugliese, R., Tuosto, E.: A formal basis for reasoning on programmable qos, verification–theory and practice. In: Proceedings of an International Symposium in Honor of Zohar Manna’s 64th Birthday. LNCS. Springer, Heidelberg (submitted for publication)Google Scholar
  18. 18.
    De Nicola, R., Ferrari, G., Pugliese, R., Venneri, B.: Types for Access Control. Theoretical Computer Science 240(1), 215–254 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering 24(5), 315–330 (1998); Special Issue: Mobility and Network Aware ComputingCrossRefGoogle Scholar
  20. 20.
    Engels, G., Hausmann, J.H., Heckel, R., Sauer, S.: Dynamic meta modeling: A graphical approach to the operational semantics of behavioural diagrams in UML. In: Evans, A., Kent, S., Selic, B. (eds.) UML 2000. LNCS, vol. 1939, pp. 323–337. Springer, Heidelberg (2000)Google Scholar
  21. 21.
    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, p. 1. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  22. 22.
    Ferrari, G., Montangero, C., Semini, L., Semprini, S.: Mark: A reasoning kit for mobility. Automated Software Engineering 9(2), 137–150 (2002)zbMATHCrossRefGoogle Scholar
  23. 23.
    Robert, W.F.: Algorithm97 (shortestpath). Communication of the ACM 5(6), 345 (1962)Google Scholar
  24. 24.
    Focardi, R., Gorrieri, R.: The Compositional Security Checker: A tool for the verification of information flow security properties. IEEE Transaction on Software Engineering 23(9), 550–571 (1997)CrossRefGoogle Scholar
  25. 25.
    Foster, I., Kesselman, C., Lee, C., Lindell, R., Nahrstedt, K., Roy, A.: A distributed resource management architecture that supports advance reservations and co-allocation. In: Proceedings of the International Workshop on Quality of Service (1999)Google Scholar
  26. 26.
    Fournet, C., Gonthier, G., Levy, J.J., Maranget, L., Remy, D.: A Calculus of Mobile Agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 406–421. Springer, Heidelberg (1996)Google Scholar
  27. 27.
    Fuggetta, A., Picco, G., Vigna, G.: Understanging Code Mobility. IEEE Transactions on Software Engineering 24(5) (1998)Google Scholar
  28. 28.
    Gelernter, D.: Generative Communication in Linda. ACM Transactions on Programming Languages and Systems 7(1), 80–112 (1985)zbMATHCrossRefGoogle Scholar
  29. 29.
    Gogolla, M.: Graph transformations on the UML Metamodel. In: ICALP Workshop on Graph Transformations and Visual Modeling Techniques, pp. 359–371. Carleton Scientific (2000)Google Scholar
  30. 30.
    Hennessy, M., Riely, J.: Resource Access Control in Systems of Mobile Agents. In: Nestmann, U., Pierce, B.C. (eds.) Proc. of HLCL 1998: High-Level Concurrent Languages. ENTCS, vol. 16.3, pp. 3–17. Elsevier, Amsterdam (1998) (to appear in Information and Computation)Google Scholar
  31. 31.
    Hennessy, M., Riely, J.: Distributed Processes and Location Failures. Theoretical Computer Science 266 (2001)Google Scholar
  32. 32.
    Hirsch, D., Inverardi, P., Montanari, U.: Reconfiguration of Software Architecture Styles with Name Mobility. In: Porto, A., Roman, G.-C. (eds.) COORDINATION 2000. LNCS, vol. 1906, pp. 148–163. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  33. 33.
    Hirsch, D., Montanari, U.: Synchronized hyperedge replacement with name mobility. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 121–135. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  34. 34.
    IBM Software Group. Web services conceptual architecture. In: IBM White Papers (2000)Google Scholar
  35. 35.
    Kuske, S., Gogolla, M., Kollmann, R., Kreowski, H.J.: An Integrated Semantics for UML Class, Object, and State Diagrams based on Graph Transformation. In: Butler, M., Petre, L., Sere, K. (eds.) IFM 2002. LNCS, vol. 2335, p. 11. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  36. 36.
    Li, B.: Agilos: A Middleware Control Architecture for Application-Aware Quality of Service Adaptations. PhD thesis, University of Illinois (2000)Google Scholar
  37. 37.
    Lowe, G.: An attack on the needham-schroeder public-key authentication protocol. Information Processing Letter 56(3), 131–133 (1995)zbMATHCrossRefGoogle Scholar
  38. 38.
    McCann, P.J., Catalin-Roman, G.: Compositional programming abstraction for mobile computing. IEEE Transactions on Software Engineering 24(2), 97–110 (1998)CrossRefGoogle Scholar
  39. 39.
    Montanari, U., Rossi, F.: Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization. In: Hankin, C., Ciancarini, P. (eds.) COORDINATION 1996. LNCS, vol. 1061. Springer, Heidelberg (1996)Google Scholar
  40. 40.
    OMG. Unified modelling language specification (2001), Available at
  41. 41.
    Oracle. Oracle 8i lite web page (1999),
  42. 42.
    Park, A.S., Reichl, P.: Personal Disconnected Operations with Mobile Agents. In: Proc. of 3rd Workshop on Personal Wireless Communications, PWC 1998 (1998)Google Scholar
  43. 43.
    Picco, G., Murphy, A.L., Roman, G.C.: LIME: Linda meets mobility. In: International Conference on Software Engineering, pp. 368–377 (1999)Google Scholar
  44. 44.
    Shaw, M., Garlan, D.: Software Architecture: Perspective on an Emerging Discipline. Prentice-Hall, Englewood Cliffs (1996)Google Scholar
  45. 45.
    Sobrinho, J.L.: Algebra and algotithms for qos path computation and hop-by-hop routing in the internet. IEEE Transactions on Networking 10(4), 541–550 (2002)CrossRefGoogle Scholar
  46. 46.
    Ster, U., Mitchell, M., Mitchell, J.C.: Automated analysis of cryptographic protocols using murφ. In: 10th IEEE Computer Security Foundations Workshop, pp. 141–151. IEEE Press, Los Alamitos (1997)Google Scholar
  47. 47.
    Waldo, J., Wyant, G., Wollrath, A., Kendall, S.: A note on distributed computing. Technical Report SMLI TR-94-29, Sun Microsystems Laboratories, Inc. (November 1994)Google Scholar
  48. 48.
    Wojciechowski, P.T., Sewell, P.: Nomadic Pict: Language and infrastructure design for mobile agents. IEEE Concurrency 8(2), 42–52 (2000)CrossRefGoogle Scholar
  49. 49.
    Xiao, X., Ni, L.M.: Internet qos: A big picture. IEEE Network 13(2), 8–18 (1999)CrossRefGoogle Scholar
  50. 50.
    Yokoo, M., Hirayama, K.: Algorithms for Distributed Constraint Satisfaction: A Review. Autonomous Agents and Multi-Agent Systems 3(2), 185–207 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Gianluigi Ferrari
    • 1
  • Ugo Montanari
    • 1
  • Emilio Tuosto
    • 1
  1. 1.Dipartimento di InformaticaUniversità di Pisa 

Personalised recommendations