Advertisement

A Full Operational Semantics for Asynchronous Relational Networks

  • Ignacio Vissani
  • Carlos Gustavo Lopez Pombo
  • Ionuţ Ţuţu
  • José Luiz Fiadeiro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9463)

Abstract

Service-oriented computing is a new paradigm where applications run over global computational networks and are formed by services discovered and bound at run-time through the intervention of a middleware. Asynchronous Relational Nets (ARNs) were presented by Fiadeiro and Lopes with the aim of formalising the elements of an interface theory for service-oriented software designs. The semantics of ARNs was originally given in terms of sequences of sets of actions corresponding to the behaviour of the service. Later, they were given an institution-based semantics where signatures are ARNs and models are morphisms into ground networks, that have no dependencies on external services.

In this work, we propose a full operational semantics capable of reflecting the dynamic nature of service execution by making explicit the reconfigurations that take place at run-time as the result of the discovery and binding of required services. This provides us a refined view of the execution of ARNs based upon which a specialized variant of linear temporal logic can be used to express, and even to verify through standard model-checking techniques, properties concerning the behaviour of ARNs that are more complex than those considered before.

References

  1. 1.
    Ausiello, G., Franciosa, P.G., Frigioni, D.: Directed hypergraphs: problems, algorithmic results, and a novel decremental approach. In: Restivo, A., Ronchi Della Rocca, S., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 312–327. Springer, Heidelberg (2001) CrossRefGoogle Scholar
  2. 2.
    Barr, M., Wells, C.: Category Theory for Computer Science. Prentice Hall, London (1990) zbMATHGoogle Scholar
  3. 3.
    Benatallah, B., Casati, F., Toumani, F.: Representing, analysing and managing Web service protocols. Data Knowl. Eng. 58(3), 327–357 (2006)CrossRefGoogle Scholar
  4. 4.
    Bradbury, J.S., Cordy, J.R., Dingel, J., Wermelinger, M.: A survey of self-management in dynamic software architecture specifications. In: Proceedings of the 1st ACM SIGSOFT Workshop on Self-Managed Systems, WOSS 2004, pp. 28–33. ACM (2004)Google Scholar
  5. 5.
    Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Bruni, R., Bucchiarone, A., Gnesi, S., Hirsch, D., Lluch Lafuente, A.: Graph-based design and analysis of dynamic software architectures. In: Degano, P., De Nicola, R., Meseguer, J. (eds.) Concurrency, Graphs and Models. LNCS, vol. 5065, pp. 37–56. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  7. 7.
    Bruni, R., Bucchiarone, A., Gnesi, S., Melgratti, H.C.: Modelling dynamic software architectures using typed graph grammars. Electr. Notes Theor. Comput. Sci. 213(1), 39–53 (2008)CrossRefzbMATHGoogle Scholar
  8. 8.
    Bruni, R., Lluch Lafuente, A., Montanari, U., Tuosto, E.: Service oriented architectural design. In: Barthe, G., Fournet, C. (eds.) TGC 2007. LNCS, vol. 4912, pp. 186–203. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  9. 9.
    Cambini, R., Gallo, G., Scutellà, M.G.: Flows on hypergraphs. Math. Program. 78, 195–217 (1997)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350, p. 119. Springer, Heidelberg (2007) CrossRefGoogle Scholar
  11. 11.
    Fiadeiro, J.L.: Categories for Software Engineering. Springer, Berlin (2005)zbMATHGoogle Scholar
  12. 12.
    Fiadeiro, J.L., Lopes, A., Bocchi, L.: An abstract model of service discovery and binding. Formal Aspects Comput. 23(4), 433–463 (2011)CrossRefGoogle Scholar
  13. 13.
    Fiadeiro, J.L., Lopes, A.: An interface theory for service-oriented design. Theor. Comput. Sci. 503, 1–30 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Gadducci, F.: Graph rewriting for the \(\pi \)-calculus. Math. Struct. Comput. Sci. 17(3), 407–437 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Jackson, D.: Software Abstractions - Logic, Language, and Analysis. MIT Press, Cambridge (2006)Google Scholar
  16. 16.
    Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems. Springer, New York (1995) CrossRefzbMATHGoogle Scholar
  17. 17.
    McLane, S.: Categories for Working Mathematician. Graduate Texts in Mathematics. Springer, Berlin (1971) Google Scholar
  18. 18.
    Perrin, D., Pin, J.É.: Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics. Elsevier Science, Amsterdam (2004) zbMATHGoogle Scholar
  19. 19.
    Pnueli, A.: The temporal semantics of concurrent programs. Theor. Comput. Sci. 13(1), 45–60 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Simonot, M., Aponte, V.: A declarative formal approach to dynamic reconfiguration. In: Proceedings of the 1st International Workshop on Open Component Ecosystems, IWOCE 2009, pp. 1–10 (2009)Google Scholar
  21. 21.
    Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pp. 133–192. Elsevier, Amsterdam (1990)Google Scholar
  22. 22.
    Ţuţu, I., Fiadeiro, J.L.: Service-oriented logic programming. Logical Methods in Computer Science (in press)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Open Access This chapter is distributed under the terms of the Creative Commons Attribution Noncommercial License, which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Authors and Affiliations

  • Ignacio Vissani
    • 1
  • Carlos Gustavo Lopez Pombo
    • 1
    • 2
  • Ionuţ Ţuţu
    • 3
    • 4
  • José Luiz Fiadeiro
    • 3
  1. 1.Departamento de ComputaciónUniversidad de Buenos AiresBuenos AiresArgentina
  2. 2.Consejo Nacional de Investigaciones Científicas y TecnológicasBuenos AiresArgentina
  3. 3.Department of Computer ScienceRoyal Holloway University of LondonSurreyUK
  4. 4.Institute of Mathematics of the Romanian AcademyResearch Group of the Project ID-3-0439BucharestRomania

Personalised recommendations