A Full Operational Semantics for Asynchronous Relational Networks
- 294 Downloads
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.
KeywordsFull Operational Semantics Linear Temporal Logic Muller Automata Hyperedge Point Requirements
- 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
- 15.Jackson, D.: Software Abstractions - Logic, Language, and Analysis. MIT Press, Cambridge (2006)Google Scholar
- 17.McLane, S.: Categories for Working Mathematician. Graduate Texts in Mathematics. Springer, Berlin (1971) Google Scholar
- 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.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.Ţuţu, I., Fiadeiro, J.L.: Service-oriented logic programming. Logical Methods in Computer Science (in press)Google Scholar