@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-tel-00874865v1> a dcat:Dataset ;
    dct:description """
              In a protocol-based Web service composition, a set of available component services collaborate together in order to provide a new composite service. Services export their protocols as finite state machines (FSMs). A transition in the FSM represents a task execution that makes the service moving to a next state. An execution of the composite corresponds to a sequence of transitions where each task is delegated to a component service. During composite run, one or more delegated components may become unavailable due to hard or soft problems on the Network. This unavailability may result in a failed execution of the composite. We provide in this thesis a formal study of the automatic recovery problem in the protocol-based Web service composition. Recovery consists in transforming the failed execution into a recovery execution. Such a transformation is performed by compensating some transitions and executing some others. The recovery execution is an alternative execution of the composite that still has the ability to reach a final state. The recovery problem consists then in finding the best recovery execution(s) among those available. The best recovery execution is attainable from the failed execution with a minimal number of visible compensations with respect to the client. For a given recovery execution, we prove that the decision problem associated with computing the number of invisibly-compensated transitions is NP-complete. Thus, we conclude that deciding of the best recovery execution is in ΣP2.
            """ ;
    dct:identifier "NNT: 2013CLF22370" ;
    dct:issued "2026-05-09T07:40:41.290828"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-09T07:40:41.290833"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Towards automatic recovery in protocol-based Web service composition" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-tel-00874865v1/resource/53cb158a-00f7-41f5-aacc-dd81fd0895b9> ;
    dcat:keyword "automates-a-etats-finis",
        "complexite",
        "complexity",
        "composition-de-services-web",
        "dependability-of-systems",
        "echecs",
        "failure",
        "fiabilite-des-systemes",
        "finite-state-machines",
        "infoeu-reposemanticsdoctoralthesis",
        "infoinfo-ohcomputer-science-csother-csoh",
        "np-completeness",
        "np-completude",
        "protocole-de-service-web",
        "recouvrement",
        "recovery",
        "self-healing-systems",
        "spiotherengineering-sciences-physicsother",
        "systemes-a-auto-recouvrement",
        "theses",
        "web-service-composition",
        "web-service-protocol" ;
    dcat:landingPage <https://theses.hal.science/tel-00874865> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-tel-00874865v1/resource/53cb158a-00f7-41f5-aacc-dd81fd0895b9> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-09T07:40:41.337975"^^xsd:dateTime ;
    dct:modified "2026-05-09T07:40:41.267981"^^xsd:dateTime ;
    dct:title "Towards automatic recovery in protocol-based Web service composition" ;
    dcat:accessURL <https://theses.hal.science/tel-00874865> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://theses.hal.science/tel-00874865> a foaf:Document .