@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-00787978v2> a dcat:Dataset ;
    dct:description """
              A message adversary is a daemon that suppresses messages in round-based message-passing synchronous systems in which no process crashes. A property imposed on a message adversary defines a subset of messages that cannot be eliminated by the adversary. It has recently been shown that when a message adversary is constrained by a property denoted TOUR (for tournament), the corresponding synchronous system and the asynchronous crash-prone read/write system have the same computability power for task solvability. This paper introduces new message adversary properties (denoted SOURCE and QUORUM), and shows that the synchronous round-based systems whose adversaries are constrained by these properties are characterizations of classical asynchronous crash-prone systems (1) whose communication is through atomic read/write registers or point-to-point message-passing, and (2) enriched with failure detectors such as Ω and Σ. Hence these properties characterize maximal adversaries, in the sense that they define strongest message adversaries equating classical asynchronous crash-prone systems. They consequently provide strong relations linking round-based synchrony weakened by message adversaries with asynchrony enriched with failure detectors. This not only enriches our understanding of the synchrony/asynchrony duality, but also allows for the establishment of a meaningful hierarchy of property-constrained message adversaries.
            """ ;
    dct:identifier "Report N°: PI-2002" ;
    dct:issued "2026-05-14T05:13:37.492392"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-14T05:13:37.492399"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Round-based Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00787978v2/resource/55b80f2b-2ee3-42ce-855b-427681630678> ;
    dcat:keyword "__",
        "asynchronous-system",
        "distributed-computability",
        "failure-detector",
        "fair-link",
        "infoeu-reposemanticsreport",
        "infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc",
        "message-ad--versary",
        "message-passing-model",
        "model-equivalence",
        "process-crash",
        "quorum",
        "readwrite-model",
        "reports",
        "round",
        "simulation",
        "source",
        "synchronous-system",
        "task",
        "tournament",
        "wait-freedom" ;
    dcat:landingPage <https://inria.hal.science/hal-00787978> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00787978v2/resource/55b80f2b-2ee3-42ce-855b-427681630678> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-14T05:13:37.497709"^^xsd:dateTime ;
    dct:modified "2026-05-14T05:13:37.447080"^^xsd:dateTime ;
    dct:title "Round-based Synchrony Weakened by Message Adversaries vs Asynchrony Enriched with Failure Detectors" ;
    dcat:accessURL <https://inria.hal.science/hal-00787978> .

<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-00787978> a foaf:Document .