Constraint-Based Concurrency and Beyond

Kazunori Ueda

doi:10.1016/j.entcs.2005.12.103

Constraint-Based Concurrency and Beyond

Kazunori Ueda^*

^*Corresponding author for this work

School of Fundamental Science and Engineering

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	327-331
Number of pages	5
Journal	Electronic Notes in Theoretical Computer Science
Volume	162
Issue number	1
DOIs	https://doi.org/10.1016/j.entcs.2005.12.103
Publication status	Published - 2006 Sept 29

Keywords

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)

Access to Document

10.1016/j.entcs.2005.12.103

Cite this

@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 = "LMNtal, concurrent constraint programming, concurrent logic programming, constraint-based concurrency, hierarchical graph rewriting, mobility, multiset rewriting",

author = "Kazunori Ueda",

note = "Funding Information: 1Partially supported by Grant-In-Aid for Scientific (C)(2)13324050 and (B)(2)14085205), MEXT and JSPS. 2 Email: ueda@ueda.info.waseda.ac.jp",

year = "2006",

month = sep,

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

N1 - Funding Information: 1Partially supported by Grant-In-Aid for Scientific (C)(2)13324050 and (B)(2)14085205), MEXT and JSPS. 2 Email: ueda@ueda.info.waseda.ac.jp

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 - LMNtal

KW - concurrent constraint programming

KW - concurrent logic programming

KW - constraint-based concurrency

KW - hierarchical graph rewriting

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

AN - SCOPUS:33748917805

SN - 1571-0661

VL - 162

SP - 327

EP - 331

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

IS - 1

ER -

Constraint-Based Concurrency and Beyond

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this