Constraint-Based Concurrency and Beyond

    Research output: Contribution to journalArticle

    Abstract

    Constraint-based concurrency is a simple and elegant formalism of concurrency with monotonic mobile channels, whose history started in early 1980's as a subfield of logic programming. Although it has hardly been recognized as process calculi, there is a close connection between them. In this paper we try to convey the essence of constraint-based concurrency to the process calculi community. We also describe how it smoothly evolved into LMNtal (pronounced "elemental"), a language model based on hierarchical graph rewriting.

    Original languageEnglish
    Pages (from-to)327-331
    Number of pages5
    JournalElectronic Notes in Theoretical Computer Science
    Volume162
    Issue number1
    DOIs
    Publication statusPublished - 2006 Sep 29

    Fingerprint

    Logic programming
    Concurrency
    Process Calculi
    Graph Rewriting
    Language Model
    Subfield
    Logic Programming
    Monotonic
    Model-based

    Keywords

    • concurrent constraint programming
    • concurrent logic programming
    • constraint-based concurrency
    • hierarchical graph rewriting
    • LMNtal
    • mobility
    • multiset rewriting

    ASJC Scopus subject areas

    • Computer Science (miscellaneous)

    Cite this

    Constraint-Based Concurrency and Beyond. / Ueda, Kazunori.

    In: Electronic Notes in Theoretical Computer Science, Vol. 162, No. 1, 29.09.2006, p. 327-331.

    Research output: Contribution to journalArticle

    @article{44bb31bffc7742dcb4f9627ef5be6317,
    title = "Constraint-Based Concurrency and Beyond",
    abstract = "Constraint-based concurrency is a simple and elegant formalism of concurrency with monotonic mobile channels, whose history started in early 1980's as a subfield of logic programming. Although it has hardly been recognized as process calculi, there is a close connection between them. In this paper we try to convey the essence of constraint-based concurrency to the process calculi community. We also describe how it smoothly evolved into LMNtal (pronounced {"}elemental{"}), a language model based on hierarchical graph rewriting.",
    keywords = "concurrent constraint programming, concurrent logic programming, constraint-based concurrency, hierarchical graph rewriting, LMNtal, mobility, multiset rewriting",
    author = "Kazunori Ueda",
    year = "2006",
    month = "9",
    day = "29",
    doi = "10.1016/j.entcs.2005.12.103",
    language = "English",
    volume = "162",
    pages = "327--331",
    journal = "Electronic Notes in Theoretical Computer Science",
    issn = "1571-0661",
    publisher = "Elsevier",
    number = "1",

    }

    TY - JOUR

    T1 - Constraint-Based Concurrency and Beyond

    AU - Ueda, Kazunori

    PY - 2006/9/29

    Y1 - 2006/9/29

    N2 - Constraint-based concurrency is a simple and elegant formalism of concurrency with monotonic mobile channels, whose history started in early 1980's as a subfield of logic programming. Although it has hardly been recognized as process calculi, there is a close connection between them. In this paper we try to convey the essence of constraint-based concurrency to the process calculi community. We also describe how it smoothly evolved into LMNtal (pronounced "elemental"), a language model based on hierarchical graph rewriting.

    AB - Constraint-based concurrency is a simple and elegant formalism of concurrency with monotonic mobile channels, whose history started in early 1980's as a subfield of logic programming. Although it has hardly been recognized as process calculi, there is a close connection between them. In this paper we try to convey the essence of constraint-based concurrency to the process calculi community. We also describe how it smoothly evolved into LMNtal (pronounced "elemental"), a language model based on hierarchical graph rewriting.

    KW - concurrent constraint programming

    KW - concurrent logic programming

    KW - constraint-based concurrency

    KW - hierarchical graph rewriting

    KW - LMNtal

    KW - mobility

    KW - multiset rewriting

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

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

    U2 - 10.1016/j.entcs.2005.12.103

    DO - 10.1016/j.entcs.2005.12.103

    M3 - Article

    VL - 162

    SP - 327

    EP - 331

    JO - Electronic Notes in Theoretical Computer Science

    JF - Electronic Notes in Theoretical Computer Science

    SN - 1571-0661

    IS - 1

    ER -