Abstract
We propose a formal operational semantics for service discovery and binding. This semantics is based on a graph-based representation of the configuration of global computers typed by business activities. Business activities execute distributed workflows that can trigger, at run time, the discovery, ranking and selection of services to which they bind, thus reconfiguring the workflows that they execute. Discovery, ranking and selection are based on compliance with required business and interaction protocols and optimisation of quality-of-service constraints. Binding and reconfiguration are captured as algebraic operations on configuration graphs. We also discuss the methodological implications that this model framework has on software engineering using a typical travel-booking scenario. To the best of our knowledge, our approach is the first to provide a clear separation between service computation and discovery/instantiation/binding, and to offer a formal framework that is independent of the SOA middleware components that act as service registries or brokers, and the protocols through which bindings and invocations are performed.
Original language | English |
---|---|
Pages (from-to) | 433-463 |
Number of pages | 31 |
Journal | Formal Aspects of Computing |
Volume | 23 |
Issue number | 4 |
DOIs | |
Publication status | Published - 27 Oct 2010 |
Keywords
- Business-reflective run-time configurations
- Discovery
- Dynamic reconfiguration
- Quality-of-service constraints
- Ranking
- Service binding
- Service level agreement
- Service-oriented computing
ASJC Scopus subject areas
- Software
- Theoretical Computer Science