Artículo

Vissani, I.; Pombo, C.G.L.; Jose, J.L.F.; Tutu I.; Codescu, M.; Diaconescu, R. "A full operational semantics for asynchronous relational networks" (2015) 22nd International Workshop on Recent Trends in Algebraic Development Techniques, WADT 2014. 9463:131-150
El editor solo permite decargar el artículo en su versión post-print desde el repositorio. Por favor, si usted posee dicha versión, enviela a
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

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 institutionbased 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 modelchecking techniques, properties concerning the behaviour of ARNs that are more complex than those considered before. Springer International Publishing Switzerland 2015.

Registro:

Documento: Artículo
Título:A full operational semantics for asynchronous relational networks
Autor:Vissani, I.; Pombo, C.G.L.; Jose, J.L.F.; Tutu I.; Codescu, M.; Diaconescu, R.
Filiación:Departamento de Computación, Universidad de Buenos Aires, Buenos Aires, Argentina
Consejo Nacional de Investigaciones Científicas y Tecnológicas, Buenos Aires, Argentina
Department of Computer Science, Royal Holloway University of London, Surrey, United Kingdom
Institute of Mathematics of the Romanian Academy, Research Group of the Project ID-3-0439, Bucharest, Romania
Palabras clave:Algebra; Complex networks; Computation theory; Computer programming languages; Distributed computer systems; Middleware; Reconfigurable hardware; Semantics; Computational networks; Linear temporal logic; Model-checking techniques; Operational semantics; Relational network; Service execution; Service oriented computing; Service-oriented softwares; Software design
Año:2015
Volumen:9463
Página de inicio:131
Página de fin:150
DOI: http://dx.doi.org/10.1007/978-3-319-28114-8_8
Título revista:22nd International Workshop on Recent Trends in Algebraic Development Techniques, WADT 2014
Título revista abreviado:Lect. Notes Comput. Sci.
ISSN:03029743
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v9463_n_p131_Vissani

Referencias:

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

Citas:

---------- APA ----------
Vissani, I., Pombo, C.G.L., Jose, J.L.F., Tutu I., Codescu, M. & Diaconescu, R. (2015) . A full operational semantics for asynchronous relational networks. 22nd International Workshop on Recent Trends in Algebraic Development Techniques, WADT 2014, 9463, 131-150.
http://dx.doi.org/10.1007/978-3-319-28114-8_8
---------- CHICAGO ----------
Vissani, I., Pombo, C.G.L., Jose, J.L.F., Tutu I., Codescu, M., Diaconescu, R. "A full operational semantics for asynchronous relational networks" . 22nd International Workshop on Recent Trends in Algebraic Development Techniques, WADT 2014 9463 (2015) : 131-150.
http://dx.doi.org/10.1007/978-3-319-28114-8_8
---------- MLA ----------
Vissani, I., Pombo, C.G.L., Jose, J.L.F., Tutu I., Codescu, M., Diaconescu, R. "A full operational semantics for asynchronous relational networks" . 22nd International Workshop on Recent Trends in Algebraic Development Techniques, WADT 2014, vol. 9463, 2015, pp. 131-150.
http://dx.doi.org/10.1007/978-3-319-28114-8_8
---------- VANCOUVER ----------
Vissani, I., Pombo, C.G.L., Jose, J.L.F., Tutu I., Codescu, M., Diaconescu, R. A full operational semantics for asynchronous relational networks. Lect. Notes Comput. Sci. 2015;9463:131-150.
http://dx.doi.org/10.1007/978-3-319-28114-8_8