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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Electronic notes in theoretical computer science Ročník 162; s. 327 - 331
Hlavní autor: Ueda, Kazunori
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 29.09.2006
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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