Constraint-Based Concurrency and Beyond

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 pa...

Full description

Saved in:

Bibliographic Details
Published in:	Electronic notes in theoretical computer science Vol. 162; pp. 327 - 331
Main Author:	Ueda, Kazunori
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 29.09.2006
Subjects:	concurrent constraint programming concurrent logic programming constraint-based concurrency hierarchical graph rewriting LMNtal mobility multiset rewriting hierarchical graph rewriting LMNtal constraint-based concurrency mobility concurrent logic programming concurrent constraint programming multiset rewriting
ISSN:	1571-0661, 1571-0661
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	1571-0661 1571-0661
DOI:	10.1016/j.entcs.2005.12.103