<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-02365497</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-21T21:37:17+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Scan: A Simple Coordination Workbench</title>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Marie</forename>
                <surname>Jacquet</surname>
              </persName>
              <email type="md5">c0636a333a619519f7a7156f085cf045</email>
              <email type="domain">unamur.be</email>
              <idno type="idhal" notation="numeric">1024631</idno>
              <idno type="halauthorid" notation="string">1275556-1024631</idno>
              <affiliation ref="#struct-364917"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Manel</forename>
                <surname>Barkallah</surname>
              </persName>
              <email type="md5">6095c8e5c6265faa9960c7903c912e20</email>
              <email type="domain">unamur.be</email>
              <idno type="idhal" notation="numeric">1058362</idno>
              <idno type="halauthorid" notation="string">1714626-1058362</idno>
              <affiliation ref="#struct-364917"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-11-15 14:12:55</date>
              <date type="whenModified">2026-04-03 13:12:01</date>
              <date type="whenReleased">2019-11-15 14:30:37</date>
              <date type="whenProduced">2019-06-17</date>
              <date type="whenEndEmbargoed">2022-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-02365497v1/document">
                <date notBefore="2022-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02365497v1/file/478673_1_En_5_Chapter.pdf" id="file-2365497-2266739">
                <date notBefore="2022-01-01"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02365497</idno>
            <idno type="halUri">https://inria.hal.science/hal-02365497</idno>
            <idno type="halBibtex">jacquet:hal-02365497</idno>
            <idno type="halRefHtml">&lt;i&gt;21th International Conference on Coordination Languages and Models (COORDINATION)&lt;/i&gt;, Jun 2019, Kongens Lyngby, Denmark. pp.75-91, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-030-22397-7_5"&gt;&amp;#x27E8;10.1007/978-3-030-22397-7_5&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">21th International Conference on Coordination Languages and Models (COORDINATION), Jun 2019, Kongens Lyngby, Denmark. pp.75-91, &amp;#x27E8;10.1007/978-3-030-22397-7_5&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-2365497-2266739"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-WG" corresp="IFIP">Working Groups</idno>
            <idno type="stamp" n="IFIP-TC6" corresp="IFIP-TC">TC 6: Communication Systems</idno>
            <idno type="stamp" n="IFIP-WG6-1" corresp="IFIP-WG">Architectures and Protocols for Distributed Systems</idno>
            <idno type="stamp" n="IFIP-COORDINATION" corresp="IFIP">COORDINATION: Conference on Coordination Models and Languages</idno>
            <idno type="stamp" n="IFIP-LNCS-11533" corresp="IFIP-LNCS">Coordination Models and Languages</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 2: Tools (1)</note>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Scan: A Simple Coordination Workbench</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Marie</forename>
                    <surname>Jacquet</surname>
                  </persName>
                  <email type="md5">c0636a333a619519f7a7156f085cf045</email>
                  <email type="domain">unamur.be</email>
                  <idno type="idhal" notation="numeric">1024631</idno>
                  <idno type="halauthorid" notation="string">1275556-1024631</idno>
                  <affiliation ref="#struct-364917"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Manel</forename>
                    <surname>Barkallah</surname>
                  </persName>
                  <email type="md5">6095c8e5c6265faa9960c7903c912e20</email>
                  <email type="domain">unamur.be</email>
                  <idno type="idhal" notation="numeric">1058362</idno>
                  <idno type="halauthorid" notation="string">1714626-1058362</idno>
                  <affiliation ref="#struct-364917"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>21th International Conference on Coordination Languages and Models (COORDINATION)</title>
                  <date type="start">2019-06-17</date>
                  <date type="end">2019-06-21</date>
                  <settlement>Kongens Lyngby</settlement>
                  <country key="DK">Denmark</country>
                </meeting>
                <editor>Hanne  Riis Nielson</editor>
                <editor>Emilio Tuosto</editor>
                <imprint>
                  <publisher>Springer International Publishing</publisher>
                  <biblScope unit="serie">Coordination Models and Languages</biblScope>
                  <biblScope unit="volume">LNCS-11533</biblScope>
                  <biblScope unit="pp">75-91</biblScope>
                  <date type="datePub">2019</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-030-22397-7_5</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Verification</term>
                <term xml:lang="en">Animation</term>
                <term xml:lang="en">Bach</term>
                <term xml:lang="en">Coordination</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halDomain" n="info.info-ni">Computer Science [cs]/Networking and Internet Architecture [cs.NI]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Although many research efforts have been spent on the theory and implementation of data-based coordination languages, not much effort has been devoted to constructing programming environments to analyze and reason on programs written in these languages. This paper proposes a simple workbench for describing concurrent systems using a Linda-like language, for animating them and for reasoning on them using a fragment of linear temporal logic. In contrast to some tools developed for traditional process algebras like CCS, a key feature of our workbench is that it maintains a direct relation between what is written by the user and its internal representation in the workbench. Another feature, particularly useful for didactic purposes, is the production of trace examples, replayable, when LTL formulae are satisfied.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 6</org>
              <org type="consortium">WG 6.1</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-364917" status="VALID">
          <idno type="ROR">https://ror.org/03d1maw17</idno>
          <orgName>Université de Namur [Namur]</orgName>
          <orgName type="acronym">UNamur</orgName>
          <date type="start">2013-01-01</date>
          <desc>
            <address>
              <addrLine>Rempart de la Vierge 8, 5000 Namur</addrLine>
              <country key="BE"/>
            </address>
            <ref type="url">https://www.unamur.be/en</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>