Guaranteeing Weak Termination in Service Discovery

  • Authors:

  • Karsten Wolf;Christian Stahl;Daniela Weinberg;Janine Ott;Robert Danitz

  • Affiliations:

  • (Correspd.) (Supported by the DFG within grant “Operating Guidelines for Services” (WO 1466/8-1)) Universität Rostock, 18051 Rostock, Germany. karsten.wolf@uni-rostock.de;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. c.stahl@tue.nl;Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. weinberg,jott,danitz@informatik.hu-berlin.de;Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. weinberg,jott,danitz@informatik.hu-berlin.de;Institut für Informatik, Humboldt-Universität zu Berlin, Unter den Linden 6, 10099 Berlin, Germany. weinberg,jott,danitz@informatik.hu-berlin.de

  • Venue:
  • Fundamenta Informaticae - Application of Concurrency to System Design, the Eighth Special Issue
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.