Verificar estado da encomenda

Faça parte de uma comunidade de amantes de livros de todo o mundo e tenha acesso a uma série de benefícios. Crie uma conta gratuitamente

Correio DHL 7.99 € Correio DPD 4.49 € Ponto DPD 3.99 € Correio GLS 5.49 € Correio MRW 5.49 € Ponto GLS 4.49 €

Contacto

Como comprar

Ajuda

A minha conta

▸ Vazio :-(

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: 50.2 EUR
Availability: InStock
Author: Nardjes Menadjelia
ISBN: 9783639709599

A formal study

Nardjes Menadjelia

Língua

Inglês

Livro Capa mole

Código Libristo: 07008501

Editoras Scholars' Press, fevereiro 2014

In a protocol-based Web service composition, a set of available component services collaborate toget... Descrição completa

Código Libristo: 07008501

122 b

50.20 €

Armazenamento externo Envio em 5-8 dias

Até 30 dias para devoluções

Os clientes também compraram

Gabler Kompakt-Lexikon Internet Lenny Ghersi

Capa mole

48.99 €

Typologie Zum UEberbetrieblichen Vergleich Von Fertigungssteuerungsverfahren Im Maschinenbau Gerhard Rabus

Capa mole

50.10 €

BITTER EARTH PETR EBEN Artigos impressos

Partituras

24.14 €

Manual de armado y reparacion de FLECHAS Godio Martin Godio

Capa mole

21.31 €

Saria. Band 1 Jean Dufaux

Livro de capa dura

11.81 €

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.