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.
This work has been supported by the European Union Seventh Framework Programme under grant agreement no. 295261 (MEALS).
This is a preview of subscription content, log in via an institution to check access.
Notes
- 1.
Formally, we can define ports as sets \(M\) of messages together with a function \(M \rightarrow {\{-, +\}}\) that assigns a polarity to every message.
- 2.
The definitions of \(G_{\alpha }\) and \(G_{\alpha '}\) follow the presentation given in Proposition 1.
- 3.
Note that \(\varLambda ^{\sharp }\) is in fact a quasi-automaton, because its components are proper classes.
- 4.
We recall from [22] that the cofree expansion of an automaton \(\varLambda = {\langle Q, 2^{A}, \varDelta , I, \mathcal {F} \rangle }\) along a map \(\sigma :A \rightarrow A'\) is the automaton \(\varLambda ' = {\langle Q, 2^{A'}, \varDelta ', I, \mathcal {F} \rangle }\) for which \({(p, \iota ', q)} \in \varDelta '\) if and only if \({(p, \sigma ^{-1}{(X')}, q)} \in \varDelta \).
References
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)
Barr, M., Wells, C.: Category Theory for Computer Science. Prentice Hall, London (1990)
Benatallah, B., Casati, F., Toumani, F.: Representing, analysing and managing Web service protocols. Data Knowl. Eng. 58(3), 327–357 (2006)
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)
Brand, D., Zafiropulo, P.: On communicating finite-state machines. J. ACM 30(2), 323–342 (1983)
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)
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)
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)
Cambini, R., Gallo, G., Scutellà, M.G.: Flows on hypergraphs. Math. Program. 78, 195–217 (1997)
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)
Fiadeiro, J.L.: Categories for Software Engineering. Springer, Berlin (2005)
Fiadeiro, J.L., Lopes, A., Bocchi, L.: An abstract model of service discovery and binding. Formal Aspects Comput. 23(4), 433–463 (2011)
Fiadeiro, J.L., Lopes, A.: An interface theory for service-oriented design. Theor. Comput. Sci. 503, 1–30 (2013)
Gadducci, F.: Graph rewriting for the \(\pi \)-calculus. Math. Struct. Comput. Sci. 17(3), 407–437 (2007)
Jackson, D.: Software Abstractions - Logic, Language, and Analysis. MIT Press, Cambridge (2006)
Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems. Springer, New York (1995)
McLane, S.: Categories for Working Mathematician. Graduate Texts in Mathematics. Springer, Berlin (1971)
Perrin, D., Pin, J.É.: Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics. Elsevier Science, Amsterdam (2004)
Pnueli, A.: The temporal semantics of concurrent programs. Theor. Comput. Sci. 13(1), 45–60 (1981)
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)
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)
Ţuţu, I., Fiadeiro, J.L.: Service-oriented logic programming. Logical Methods in Computer Science (in press)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Vissani, I., Pombo, C.G.L., Ţuţu, I., Fiadeiro, J.L. (2015). A Full Operational Semantics for Asynchronous Relational Networks. In: Codescu, M., Diaconescu, R., Țuțu, I. (eds) Recent Trends in Algebraic Development Techniques. WADT 2015. Lecture Notes in Computer Science(), vol 9463. Springer, Cham. https://doi.org/10.1007/978-3-319-28114-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-28114-8_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-28113-1
Online ISBN: 978-3-319-28114-8
eBook Packages: Computer ScienceComputer Science (R0)