Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

DPD courier 4.99 € GLS courier 9.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Automatic Failure Recovery in Protocol-Based Web Service Composition

Name: Automatic Failure Recovery in Protocol-Based Web Service Composition
Brand: Scholars' Press
SKU: 07008501
Price: 53.27 EUR
Availability: InStock
Author: Nardjes Menadjelia
ISBN: 9783639709599

A formal study

Nardjes Menadjelia

Language

English

Book Paperback

Libristo code: 07008501

Publishers Scholars' Press, February 2014

In a protocol-based Web service composition, a set of available component services collaborate toget... Full description

Libristo code: 07008501

129 b

53.27 €

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Gabler Kompakt-Lexikon Internet Lenny Ghersi

Paperback

51.76 €

Typologie Zum UEberbetrieblichen Vergleich Von Fertigungssteuerungsverfahren Im Maschinenbau Gerhard Rabus

Paperback

52.97 €

BITTER EARTH PETR EBEN Printed items

Sheet music

27.74 €

Manual de armado y reparacion de FLECHAS Godio Martin Godio

Paperback

23.70 €

Saria. Band 1 Jean Dufaux

Hardback

12.60 €

In a protocol-based Web service composition, a set of available component services collaborate together in order to provide a new composite service. An execution of the composite corresponds to a sequence of delegations to component services. Thus, the runtime unavailability of one or more components may result in a failed execution of the composite. Therefore, it is necessary to establish a recovery mechanism that allows the composite service to overcome the occurred failure. In this work, we study the automatic recovery problem in the protocol-based Web service composition. A recovery is a process migrating the failed execution into an alternative execution of the composite that we call a recovery execution. The recovery execution should be able to reach a final state. The recovery problem consists in finding the best recovery execution(s) among those available. The best recovery execution must be attainable from the failed execution with a minimal number of visible compensations with respect to the client. For a given recovery execution, we prove in this work that the decision problem associated with computing the number of invisibly-compensated transitions is NP-complete.