From Synchrony to Asynchrony View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2002-04-19

AUTHORS

Albert Benveniste , Benoît Caillaud , Paul Le Guernic

ABSTRACT

We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guarantee correct desynchronization, meaning that the original synchronous semantics can be reconstructed from the result of this desynchronization. Theorems are given for both the desynchronization of single synchronous programs, and for networks of synchronous programs to be implemented using asynchronous communication. Assumptions for these theorems correspond to proof obligations that can be checked on the original synchronous designs. If the corresponding conditions are not satisfied, suitable synchronous miniprograms which will ensure correct desynchronization can be composed with the original ones. This can be seen as a systematic way to generate “correct protocols” for the asynchronous distribution of synchronous designs. The whole approach has been implemented, in the framework of the Sacres project, within the Sildex tool marketed by Tni, as well as in the Signal compiler. More... »

PAGES

162-177

References to SciGraph publications

  • 1993. Synchronous Programming of Reactive Systems in NONE
  • 1995. Signal: A formal design environment for real-time systems in TAPSOFT '95: THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT
  • Book

    TITLE

    CONCUR’99 Concurrency Theory

    ISBN

    978-3-540-66425-3
    978-3-540-48320-5

    Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/3-540-48320-9_13

    DOI

    http://dx.doi.org/10.1007/3-540-48320-9_13

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1029840242


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0802", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Computation Theory and Mathematics", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "name": [
                "Irisa/Inria, Campus de Beaulie, 35042, Rennes cedex, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Benveniste", 
            "givenName": "Albert", 
            "id": "sg:person.011174600625.42", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011174600625.42"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "name": [
                "Irisa/Inria, Campus de Beaulie, 35042, Rennes cedex, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Caillaud", 
            "givenName": "Beno\u00eet", 
            "id": "sg:person.015010026051.83", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015010026051.83"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "name": [
                "Irisa/Inria, Campus de Beaulie, 35042, Rennes cedex, France"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Le Guernic", 
            "givenName": "Paul", 
            "id": "sg:person.012323217107.52", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012323217107.52"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "https://doi.org/10.1145/69624.357207", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1004142526"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/3-540-59293-8_235", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009705289", 
              "https://doi.org/10.1007/3-540-59293-8_235"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4757-2231-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048495206", 
              "https://doi.org/10.1007/978-1-4757-2231-4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-1-4757-2231-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1048495206", 
              "https://doi.org/10.1007/978-1-4757-2231-4"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0304-3975(92)90326-b", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1052279998"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/32.159839", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061153612"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/5.97297", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061180431"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/5.97301", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061180435"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/9.53519", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1061245003"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/lics.1996.561320", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095073529"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1109/icip.1996.560623", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1095232869"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2002-04-19", 
        "datePublishedReg": "2002-04-19", 
        "description": "We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guarantee correct desynchronization, meaning that the original synchronous semantics can be reconstructed from the result of this desynchronization. Theorems are given for both the desynchronization of single synchronous programs, and for networks of synchronous programs to be implemented using asynchronous communication. Assumptions for these theorems correspond to proof obligations that can be checked on the original synchronous designs. If the corresponding conditions are not satisfied, suitable synchronous miniprograms which will ensure correct desynchronization can be composed with the original ones. This can be seen as a systematic way to generate \u201ccorrect protocols\u201d for the asynchronous distribution of synchronous designs. The whole approach has been implemented, in the framework of the Sacres project, within the Sildex tool marketed by Tni, as well as in the Signal compiler.", 
        "editor": [
          {
            "familyName": "Baeten", 
            "givenName": "Jos C. M.", 
            "type": "Person"
          }, 
          {
            "familyName": "Mauw", 
            "givenName": "Sjouke", 
            "type": "Person"
          }
        ], 
        "genre": "chapter", 
        "id": "sg:pub.10.1007/3-540-48320-9_13", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": {
          "isbn": [
            "978-3-540-66425-3", 
            "978-3-540-48320-5"
          ], 
          "name": "CONCUR\u201999 Concurrency Theory", 
          "type": "Book"
        }, 
        "name": "From Synchrony to Asynchrony", 
        "pagination": "162-177", 
        "productId": [
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/3-540-48320-9_13"
            ]
          }, 
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "8e27d9369a39e7b8f82e86e84b65c7c1850d64bf779950903773943a911b5241"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1029840242"
            ]
          }
        ], 
        "publisher": {
          "location": "Berlin, Heidelberg", 
          "name": "Springer Berlin Heidelberg", 
          "type": "Organisation"
        }, 
        "sameAs": [
          "https://doi.org/10.1007/3-540-48320-9_13", 
          "https://app.dimensions.ai/details/publication/pub.1029840242"
        ], 
        "sdDataset": "chapters", 
        "sdDatePublished": "2019-04-16T05:45", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000347_0000000347/records_89807_00000001.jsonl", 
        "type": "Chapter", 
        "url": "https://link.springer.com/10.1007%2F3-540-48320-9_13"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/3-540-48320-9_13'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/3-540-48320-9_13'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/3-540-48320-9_13'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/3-540-48320-9_13'


     

    This table displays all metadata directly associated to this object as RDF triples.

    119 TRIPLES      23 PREDICATES      36 URIs      19 LITERALS      8 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/3-540-48320-9_13 schema:about anzsrc-for:08
    2 anzsrc-for:0802
    3 schema:author N1d98987e806e45bd89d1de4f50b860f3
    4 schema:citation sg:pub.10.1007/3-540-59293-8_235
    5 sg:pub.10.1007/978-1-4757-2231-4
    6 https://doi.org/10.1016/0304-3975(92)90326-b
    7 https://doi.org/10.1109/32.159839
    8 https://doi.org/10.1109/5.97297
    9 https://doi.org/10.1109/5.97301
    10 https://doi.org/10.1109/9.53519
    11 https://doi.org/10.1109/icip.1996.560623
    12 https://doi.org/10.1109/lics.1996.561320
    13 https://doi.org/10.1145/69624.357207
    14 schema:datePublished 2002-04-19
    15 schema:datePublishedReg 2002-04-19
    16 schema:description We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guarantee correct desynchronization, meaning that the original synchronous semantics can be reconstructed from the result of this desynchronization. Theorems are given for both the desynchronization of single synchronous programs, and for networks of synchronous programs to be implemented using asynchronous communication. Assumptions for these theorems correspond to proof obligations that can be checked on the original synchronous designs. If the corresponding conditions are not satisfied, suitable synchronous miniprograms which will ensure correct desynchronization can be composed with the original ones. This can be seen as a systematic way to generate “correct protocols” for the asynchronous distribution of synchronous designs. The whole approach has been implemented, in the framework of the Sacres project, within the Sildex tool marketed by Tni, as well as in the Signal compiler.
    17 schema:editor Nc61fe885383c438b9d80b4b171433627
    18 schema:genre chapter
    19 schema:inLanguage en
    20 schema:isAccessibleForFree false
    21 schema:isPartOf Nd09f0d6b1b334d42ae7aa7546737febc
    22 schema:name From Synchrony to Asynchrony
    23 schema:pagination 162-177
    24 schema:productId N47994b8d81e440ef906bf2defc3439b7
    25 N732f45beae1945299310c3083289970f
    26 Nc6d7c65e82604046b504fdf5ed8ff882
    27 schema:publisher N5746e791484d47af921ceb8e0ebb7cd5
    28 schema:sameAs https://app.dimensions.ai/details/publication/pub.1029840242
    29 https://doi.org/10.1007/3-540-48320-9_13
    30 schema:sdDatePublished 2019-04-16T05:45
    31 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    32 schema:sdPublisher Ne76a232c574640678b0dea65e2594586
    33 schema:url https://link.springer.com/10.1007%2F3-540-48320-9_13
    34 sgo:license sg:explorer/license/
    35 sgo:sdDataset chapters
    36 rdf:type schema:Chapter
    37 N1d98987e806e45bd89d1de4f50b860f3 rdf:first sg:person.011174600625.42
    38 rdf:rest Nc0318a660d18456693d6f020b186dead
    39 N2281d054c9c2499e8ce48ec276720fe9 schema:name Irisa/Inria, Campus de Beaulie, 35042, Rennes cedex, France
    40 rdf:type schema:Organization
    41 N28cf983264284c5491acf93d7bb90235 rdf:first N32d4bab571894a90a3e8baf6d1fba31e
    42 rdf:rest rdf:nil
    43 N32d4bab571894a90a3e8baf6d1fba31e schema:familyName Mauw
    44 schema:givenName Sjouke
    45 rdf:type schema:Person
    46 N47994b8d81e440ef906bf2defc3439b7 schema:name doi
    47 schema:value 10.1007/3-540-48320-9_13
    48 rdf:type schema:PropertyValue
    49 N5746e791484d47af921ceb8e0ebb7cd5 schema:location Berlin, Heidelberg
    50 schema:name Springer Berlin Heidelberg
    51 rdf:type schema:Organisation
    52 N732f45beae1945299310c3083289970f schema:name readcube_id
    53 schema:value 8e27d9369a39e7b8f82e86e84b65c7c1850d64bf779950903773943a911b5241
    54 rdf:type schema:PropertyValue
    55 N79404a72d152457bbf25597eee53bdaa schema:name Irisa/Inria, Campus de Beaulie, 35042, Rennes cedex, France
    56 rdf:type schema:Organization
    57 N9a5248d7805f4a8f882f0a54463c6707 rdf:first sg:person.012323217107.52
    58 rdf:rest rdf:nil
    59 Naf33f3bb12e1406bb6e85946c0c461b8 schema:familyName Baeten
    60 schema:givenName Jos C. M.
    61 rdf:type schema:Person
    62 Nb08739bc639b4de8b934a4d7cd40be9a schema:name Irisa/Inria, Campus de Beaulie, 35042, Rennes cedex, France
    63 rdf:type schema:Organization
    64 Nc0318a660d18456693d6f020b186dead rdf:first sg:person.015010026051.83
    65 rdf:rest N9a5248d7805f4a8f882f0a54463c6707
    66 Nc61fe885383c438b9d80b4b171433627 rdf:first Naf33f3bb12e1406bb6e85946c0c461b8
    67 rdf:rest N28cf983264284c5491acf93d7bb90235
    68 Nc6d7c65e82604046b504fdf5ed8ff882 schema:name dimensions_id
    69 schema:value pub.1029840242
    70 rdf:type schema:PropertyValue
    71 Nd09f0d6b1b334d42ae7aa7546737febc schema:isbn 978-3-540-48320-5
    72 978-3-540-66425-3
    73 schema:name CONCUR’99 Concurrency Theory
    74 rdf:type schema:Book
    75 Ne76a232c574640678b0dea65e2594586 schema:name Springer Nature - SN SciGraph project
    76 rdf:type schema:Organization
    77 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    78 schema:name Information and Computing Sciences
    79 rdf:type schema:DefinedTerm
    80 anzsrc-for:0802 schema:inDefinedTermSet anzsrc-for:
    81 schema:name Computation Theory and Mathematics
    82 rdf:type schema:DefinedTerm
    83 sg:person.011174600625.42 schema:affiliation N2281d054c9c2499e8ce48ec276720fe9
    84 schema:familyName Benveniste
    85 schema:givenName Albert
    86 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011174600625.42
    87 rdf:type schema:Person
    88 sg:person.012323217107.52 schema:affiliation Nb08739bc639b4de8b934a4d7cd40be9a
    89 schema:familyName Le Guernic
    90 schema:givenName Paul
    91 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012323217107.52
    92 rdf:type schema:Person
    93 sg:person.015010026051.83 schema:affiliation N79404a72d152457bbf25597eee53bdaa
    94 schema:familyName Caillaud
    95 schema:givenName Benoît
    96 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015010026051.83
    97 rdf:type schema:Person
    98 sg:pub.10.1007/3-540-59293-8_235 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009705289
    99 https://doi.org/10.1007/3-540-59293-8_235
    100 rdf:type schema:CreativeWork
    101 sg:pub.10.1007/978-1-4757-2231-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048495206
    102 https://doi.org/10.1007/978-1-4757-2231-4
    103 rdf:type schema:CreativeWork
    104 https://doi.org/10.1016/0304-3975(92)90326-b schema:sameAs https://app.dimensions.ai/details/publication/pub.1052279998
    105 rdf:type schema:CreativeWork
    106 https://doi.org/10.1109/32.159839 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061153612
    107 rdf:type schema:CreativeWork
    108 https://doi.org/10.1109/5.97297 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061180431
    109 rdf:type schema:CreativeWork
    110 https://doi.org/10.1109/5.97301 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061180435
    111 rdf:type schema:CreativeWork
    112 https://doi.org/10.1109/9.53519 schema:sameAs https://app.dimensions.ai/details/publication/pub.1061245003
    113 rdf:type schema:CreativeWork
    114 https://doi.org/10.1109/icip.1996.560623 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095232869
    115 rdf:type schema:CreativeWork
    116 https://doi.org/10.1109/lics.1996.561320 schema:sameAs https://app.dimensions.ai/details/publication/pub.1095073529
    117 rdf:type schema:CreativeWork
    118 https://doi.org/10.1145/69624.357207 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004142526
    119 rdf:type schema:CreativeWork
     




    Preview window. Press ESC to close (or click here)


    ...