Constraint-Based Concurrency and Beyond

    Research output: Contribution to journalArticle


    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
    Issue number1
    Publication statusPublished - 2006 Sep 29



    • 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