@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-hal-00787992v2> a dcat:Dataset ;
    dct:description """
              This paper investigates the relation linking the s-simultaneous consensus problem and the k-set agreement problem. To this end, it first defines the (s, k)-SSA problem which captures jointly both problems: each process proposes a value, executes s simultaneous instances of the k-set agreement problem, and has to decide a value so that no more than sk different values are decided. The paper introduces then a new failure detector class denoted Zs,k , which is made up of two components, one focused on the "shared memory object" that allows the processes to cooperate, and the other focused on the liveness of (s, k)-SSA algorithms. A novelty of this failure detector lies in the fact that the definition of its two components are intimately related. Then, the paper presents a Zs,k -based algorithm that solves the (s, k)-SSA problem, and shows that the "shared memory"-oriented part of Zs,k is necessary to solve the (s, k)-SSA problem (this generalizes and refines a previous result that showed that the failure detector Σk is necessary to solve k-set agreement). Finally, the paper investigates the structure of the family of (s, k)-SSA problems and introduces generalized (asymmetric) simultaneous set agreement problems in which the parameter k can differ in each underlying k-set agreement instance. Among other points, it shows that, for s, k > 1, (a) the (sk, 1)-SSA problem is strictly stronger that the (s, k)-SSA problem which is itself strictly stronger than the (1, ks)-SSA problem, and (b) there are pairs (s1 , k1 ) and (s2 , k2 ) such that s1 k1 = s2 k2 and (s1 , k1 )-SSA and (s2 , k2 )-SSA are incomparable.
            """ ;
    dct:identifier "Report N°: PI-2003" ;
    dct:issued "2026-05-14T05:17:15.373691"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-14T05:17:15.373697"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Simultaneous Consensus vs Set Agreement a Message-Passing Sensitive Hierarchy of Agreement Problems" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00787992v2/resource/a761a1cc-d9db-4b8c-85fa-eb0e0bceed2f> ;
    dcat:keyword "accord-k-ensembliste",
        "calcul-reparti",
        "consensus-simultanes",
        "detecteur-de-fautes",
        "infoeu-reposemanticsreport",
        "infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc",
        "quorum",
        "reduction",
        "reports",
        "sans-attente",
        "systeme-a-passage-de-messages",
        "systeme-asynchrone",
        "tolerance-aux-pannes" ;
    dcat:landingPage <https://inria.hal.science/hal-00787992> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00787992v2/resource/a761a1cc-d9db-4b8c-85fa-eb0e0bceed2f> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-14T05:17:15.397336"^^xsd:dateTime ;
    dct:modified "2026-05-14T05:17:15.350342"^^xsd:dateTime ;
    dct:title "Simultaneous Consensus vs Set Agreement a Message-Passing Sensitive Hierarchy of Agreement Problems" ;
    dcat:accessURL <https://inria.hal.science/hal-00787992> .

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

<https://inria.hal.science/hal-00787992> a foaf:Document .