Constraint-Based Concurrency and Beyond

Kazunori Ueda*

*この研究の対応する著者

研究成果: Article査読

抄録

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.

本文言語English
ページ(範囲)327-331
ページ数5
ジャーナルElectronic Notes in Theoretical Computer Science
162
1
DOI
出版ステータスPublished - 2006 9月 29

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Constraint-Based Concurrency and Beyond」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル