Constraint-Based Concurrency and Beyond

Kazunori Ueda*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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 Sept 29


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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Constraint-Based Concurrency and Beyond'. Together they form a unique fingerprint.

Cite this