A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit <a rel="external noopener" href="https://link.springer.com/content/pdf/10.1007%2F3-540-56610-4_64.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a>
We define a true concurrency semantics for LO, a reactive programming language characterized by dynamically reeonfigurable agents (processes), with interagent communication implemented as broadcasting and logical operators corresponding to Linear Logic colmectives. Our semantic model is given by the well-known Chemical Abstract Machine formalism, where concurrent events happen in the form of chemicallike reactions. Our approach consists of inapping LO computations into CHAM computations and is<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-56610-4_64">doi:10.1007/3-540-56610-4_64</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/w4srdktjczbclhda4ijsjnrlue">fatcat:w4srdktjczbclhda4ijsjnrlue</a> </span>
more »... asily generalizable to CHAM-related models like CHARMs, rewriting logics etc. We propose two mappings from LO to CHAMs, both making use of the "meinbrane" mechanism of the CHAM, but differing in the choice of active elements: in one case, the inessages are passive and the agents are the active entities which perform read and write operations; hy contrast, in the second case, the agents are passive with respect to colnmunication and the nlessages themselves move around the solution to deliver their content to each agent. The results in the paper show the ettectiveness of the CHAM and related formalisms as abstract fl'ameworks for modeling the implementation of practical languages on parallel architectures. Furthermore, they provide insight on the two following issues: (i) the amount of synchronization needed to add broadcasting to one-to-one comluunication primitives; (ii) the problem of parallel searching for Linear Logic proofs.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180727164756/https://link.springer.com/content/pdf/10.1007%2F3-540-56610-4_64.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/29/c6/29c63569edda46eecface05baaa8f405fc18f83e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-56610-4_64"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>