Encoding Distributed Process Calculi into LMNtal

    Research output: Contribution to journalArticle

    7 Citations (Scopus)

    Abstract

    Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. Diverse computational models including the π-calculus and the λ-calculus have been encoded into LMNtal and tested on our LMNtal system. This paper describes the encoding of the ambient calculus with running examples. The technical crux is the distributed management of names in the presence of locality an mobility. We have designed and implemented a self-adjusting management technique of names in which the name management and mobility operations are performed concurrently.

    Original languageEnglish
    Pages (from-to)187-200
    Number of pages14
    JournalElectronic Notes in Theoretical Computer Science
    Volume209
    Issue numberC
    DOIs
    Publication statusPublished - 2008 Apr 24

    Fingerprint

    Process Calculi
    Calculus
    Encoding
    Graph Rewriting
    Concurrency
    Locality
    Computational Model
    Connectivity
    Membrane
    Membranes
    Model

    Keywords

    • Ambient calculus
    • Distributed process calculi
    • Hierarchical graph rewriting
    • LMNtal
    • Self-adjusting name management

    ASJC Scopus subject areas

    • Computer Science (miscellaneous)

    Cite this

    Encoding Distributed Process Calculi into LMNtal. / Ueda, Kazunori.

    In: Electronic Notes in Theoretical Computer Science, Vol. 209, No. C, 24.04.2008, p. 187-200.

    Research output: Contribution to journalArticle

    @article{2eafb26466064282bb3c08e01ce6311c,
    title = "Encoding Distributed Process Calculi into LMNtal",
    abstract = "Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced {"}elemental{"}), a model and language based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. Diverse computational models including the π-calculus and the λ-calculus have been encoded into LMNtal and tested on our LMNtal system. This paper describes the encoding of the ambient calculus with running examples. The technical crux is the distributed management of names in the presence of locality an mobility. We have designed and implemented a self-adjusting management technique of names in which the name management and mobility operations are performed concurrently.",
    keywords = "Ambient calculus, Distributed process calculi, Hierarchical graph rewriting, LMNtal, Self-adjusting name management",
    author = "Kazunori Ueda",
    year = "2008",
    month = "4",
    day = "24",
    doi = "10.1016/j.entcs.2008.04.012",
    language = "English",
    volume = "209",
    pages = "187--200",
    journal = "Electronic Notes in Theoretical Computer Science",
    issn = "1571-0661",
    publisher = "Elsevier",
    number = "C",

    }

    TY - JOUR

    T1 - Encoding Distributed Process Calculi into LMNtal

    AU - Ueda, Kazunori

    PY - 2008/4/24

    Y1 - 2008/4/24

    N2 - Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. Diverse computational models including the π-calculus and the λ-calculus have been encoded into LMNtal and tested on our LMNtal system. This paper describes the encoding of the ambient calculus with running examples. The technical crux is the distributed management of names in the presence of locality an mobility. We have designed and implemented a self-adjusting management technique of names in which the name management and mobility operations are performed concurrently.

    AB - Towards a unifying model of concurrency, we have designed and implemented LMNtal (pronounced "elemental"), a model and language based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. Diverse computational models including the π-calculus and the λ-calculus have been encoded into LMNtal and tested on our LMNtal system. This paper describes the encoding of the ambient calculus with running examples. The technical crux is the distributed management of names in the presence of locality an mobility. We have designed and implemented a self-adjusting management technique of names in which the name management and mobility operations are performed concurrently.

    KW - Ambient calculus

    KW - Distributed process calculi

    KW - Hierarchical graph rewriting

    KW - LMNtal

    KW - Self-adjusting name management

    UR - http://www.scopus.com/inward/record.url?scp=42949110063&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=42949110063&partnerID=8YFLogxK

    U2 - 10.1016/j.entcs.2008.04.012

    DO - 10.1016/j.entcs.2008.04.012

    M3 - Article

    VL - 209

    SP - 187

    EP - 200

    JO - Electronic Notes in Theoretical Computer Science

    JF - Electronic Notes in Theoretical Computer Science

    SN - 1571-0661

    IS - C

    ER -