Guaranteeing weak termination in service discovery

K. Wolf, C. Stahl, D. Weinberg, J. Ott, R. Danitz

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)


A big issue in the paradigm of Service Oriented Architectures (SOA) is service discovery. Organizations publish their services via the Internet. These published services can then be automatically found and accessed by other services, meaning, the services are composed. A fundamental property of a service composition is weak termination, which guarantees the absence of deadlocks and livelocks. In principle, weak termination can be verified by inspecting the state space of the composition of (public views of) the involved services. We propose a methodology to build that state space from precomputed fragments, which are computed upon publishing a service. That way, we shift computation effort from the resource critical "find" phase to the less critical "publish" phase. Interestingly, our setting enables state space reduction methods that are intrinsically different from traditional state space reductions. We further show the positive impact of our approach to the computational effort of service discovery. Keywords: deadlock- and livelock freedom, SOA, service discovery, state space reduction
Original languageEnglish
Pages (from-to)151-180
JournalFundamenta Informaticae
Issue number1-2
Publication statusPublished - 2011


Dive into the research topics of 'Guaranteeing weak termination in service discovery'. Together they form a unique fingerprint.

Cite this