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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronic notes in theoretical computer science Jg. 162; S. 327 - 331
1. Verfasser: Ueda, Kazunori
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 29.09.2006
Schlagworte:
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-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
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.
AbstractList 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.
Author Ueda, Kazunori
Author_xml – sequence: 1
  givenname: Kazunori
  surname: Ueda
  fullname: Ueda, Kazunori
  email: ueda@ueda.info.waseda.ac.jp
  organization: Department of Computer Science, Waseda University, 4-1, Okubo 3-chome, Shinjuku-ku, Tokyo 169-8555, Japan
BookMark eNp9j0tLxDAUhYOM4MzoL3DTnavWvJq0CxdO8QUDbnQdmpsbaNFUkir035txXLhydS8HvsP5NmQVpoCEXDJaMcrU9VhhmCFVnNK6YjyH4oSsWa1ZSZViqz__GdmkNFIqGqbVmlx1U0hz7Icwl7s-oStyAJ8xYoCl6IMrdrhMwZ2TU9-_Jbz4vVvyen_30j2W--eHp-52X4JQci6dRttatAqscF57xXlrvVZWMqudV0AlcGgkOCutrLUXTd3mVaCzRg1cbIk49kKcUorozUcc3vu4GEbNwdWM5sfVHFwN4zkUmbo5UpinfQ0YTYIhG6AbIsJs3DT8y38DNBtfng
Cites_doi 10.1145/153520.153534
10.1007/3-540-16479-0_17
ContentType Journal Article
Copyright 2006 Elsevier B.V.
Copyright_xml – notice: 2006 Elsevier B.V.
DBID 6I.
AAFTH
AAYXX
CITATION
DOI 10.1016/j.entcs.2005.12.103
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1571-0661
EndPage 331
ExternalDocumentID 10_1016_j_entcs_2005_12_103
S1571066106004567
GroupedDBID --K
--M
0R~
1B1
1~5
4.4
457
4G.
5GY
5VS
6I.
7-5
71M
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIKJ
AAKOC
AALRI
AAQFI
AAXUO
ABMAC
ABWVN
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACRPL
ACXMD
ADBBV
ADEZE
ADMUD
ADNMO
ADVLN
AEIPS
AEKER
AEXQZ
AFTJW
AFXIZ
AGHFR
AIEXJ
AIKHN
AITUG
AKRWK
ALMA_UNASSIGNED_HOLDINGS
AMRAJ
ANKPU
AXJTR
CS3
DU5
EBS
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FNPLU
G-Q
HVGLF
HZ~
IHE
IXB
J1W
KOM
KQ8
M41
M~E
N9A
O-L
O9-
OK1
OZT
P2P
RIG
ROL
RPZ
SDG
SES
SPC
SSH
SSV
SSW
SSZ
29G
9DU
AAQXK
AAYWO
AAYXX
ABFNM
ACLOT
ACVFH
ADCNI
ADFGL
AEUPX
AFPUW
AGQPQ
AIGII
AJMQA
AKBMS
AKYEP
AOUOD
ASPBG
AVWKF
AZFZN
CITATION
FGOYB
GBLVA
R2-
SEW
~HD
ID FETCH-LOGICAL-c364t-d7eb9beb6cb3df7f6229bf76b41b7df6c04c2c84cdb4b457f3859661c70165c23
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000214195700050&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1571-0661
IngestDate Sat Nov 29 07:00:21 EST 2025
Thu Apr 10 08:06:46 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Keywords hierarchical graph rewriting
LMNtal
constraint-based concurrency
mobility
concurrent logic programming
concurrent constraint programming
multiset rewriting
Language English
License http://creativecommons.org/licenses/by-nc-nd/3.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c364t-d7eb9beb6cb3df7f6229bf76b41b7df6c04c2c84cdb4b457f3859661c70165c23
OpenAccessLink https://dx.doi.org/10.1016/j.entcs.2005.12.103
PageCount 5
ParticipantIDs crossref_primary_10_1016_j_entcs_2005_12_103
elsevier_sciencedirect_doi_10_1016_j_entcs_2005_12_103
PublicationCentury 2000
PublicationDate 2006-09-29
PublicationDateYYYYMMDD 2006-09-29
PublicationDate_xml – month: 09
  year: 2006
  text: 2006-09-29
  day: 29
PublicationDecade 2000
PublicationTitle Electronic notes in theoretical computer science
PublicationYear 2006
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Ueda (bib003) 1999
Ueda (bib004) 2001; 2215
Ueda (bib005) 2005; 3365
bib006
Ueda, K., “Guarded Horn Clauses,” ICOT Tech. Report TR-103, ICOT, Tokyo, 1985. Also in Logic Programming '85, LNCS
Shapiro, Warren, Fuchi, Kowalski, Furukawa, Ueda, Kahn, Chikayama, Tick (bib002) 1993; 36
Springer, 1986, 168–179
Ueda (10.1016/j.entcs.2005.12.103_bib003) 1999
Ueda (10.1016/j.entcs.2005.12.103_bib005) 2005; 3365
10.1016/j.entcs.2005.12.103_bib001
Shapiro (10.1016/j.entcs.2005.12.103_bib002) 1993; 36
Ueda (10.1016/j.entcs.2005.12.103_bib004) 2001; 2215
References_xml – volume: 3365
  start-page: 110
  year: 2005
  end-page: 125
  ident: bib005
  article-title: LMNtal: A Language Model with Links and Membranes
  publication-title: Proc. WMC5
– volume: 36
  start-page: 46
  year: 1993
  end-page: 103
  ident: bib002
  article-title: The Fifth Generation Project: Personal Perspectives
  publication-title: Comm. ACM
– reference: Ueda, K., “Guarded Horn Clauses,” ICOT Tech. Report TR-103, ICOT, Tokyo, 1985. Also in Logic Programming '85, LNCS
– volume: 2215
  start-page: 95
  year: 2001
  end-page: 126
  ident: bib004
  article-title: Resource-Passing Concurrent Programming
  publication-title: Proc. TACS 2001
– reference: , Springer, 1986, 168–179
– start-page: 53
  year: 1999
  end-page: 71
  ident: bib003
  article-title: Concurrent Logic/Constraint Programming: The Next 10 Years
  publication-title: The Logic Programming Paradigm: A 25-Year Perspective
– ident: bib006
– volume: 36
  start-page: 46
  year: 1993
  ident: 10.1016/j.entcs.2005.12.103_bib002
  article-title: The Fifth Generation Project: Personal Perspectives
  publication-title: Comm. ACM
  doi: 10.1145/153520.153534
– ident: 10.1016/j.entcs.2005.12.103_bib001
  doi: 10.1007/3-540-16479-0_17
– start-page: 53
  year: 1999
  ident: 10.1016/j.entcs.2005.12.103_bib003
  article-title: Concurrent Logic/Constraint Programming: The Next 10 Years
– volume: 2215
  start-page: 95
  year: 2001
  ident: 10.1016/j.entcs.2005.12.103_bib004
  article-title: Resource-Passing Concurrent Programming
– volume: 3365
  start-page: 110
  year: 2005
  ident: 10.1016/j.entcs.2005.12.103_bib005
  article-title: LMNtal: A Language Model with Links and Membranes
SSID ssj0038176
Score 1.4226487
Snippet Constraint-based concurrency is a simple and elegant formalism of concurrency with monotonic mobile channels, whose history started in early 1980's as a...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 327
SubjectTerms concurrent constraint programming
concurrent logic programming
constraint-based concurrency
hierarchical graph rewriting
LMNtal
mobility
multiset rewriting
Title Constraint-Based Concurrency and Beyond
URI https://dx.doi.org/10.1016/j.entcs.2005.12.103
Volume 162
WOSCitedRecordID wos000214195700050&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1571-0661
  dateEnd: 20201231
  omitProxy: false
  ssIdentifier: ssj0038176
  issn: 1571-0661
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1571-0661
  dateEnd: 20201231
  omitProxy: false
  ssIdentifier: ssj0038176
  issn: 1571-0661
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Na9VAFB20unBT6xdWrWQhuNApzcwkd7JUqbixCLbQXcjcmYF2kVfeS6V00d_eO199bV8RFdyEMDCZJCecezPccw9j76TQVhLvc-cRuFISuBmU5t5Z7QdCHLWPZhOwt6cPD7sf2UpuEe0EYBz12Vl38l-hpjECO0hn_wLuq4vSAJ0T6HQk2On4R8AHC85o_DDxzxSibBD1YezChKnXUhKt3NiSX3rhjLMplmjdUDhitn74kONlQenA2awoOz8dZ_Oj21sIHRdLolrVtiQqhFATlVqlb7s7xgp_ZjpNDCiT1D8H0yzHWuHptGVwvE2BFRdpZ6sWoQHAMixdFQv-DKuGRXfamIDCffZAQNMFDvt-sVvibmg1GLVk5R5Lj6lYzbey0N15yLXcYn-DreefgupTAvMJu-fGp-xxMdyoMv8-Y-9vY1tdw7YibKuE7XN28HV3_8s3np0uOMpWTdyCM51xpkUjrQffCtEZD61RtQHrW9xRKFArtEYZ1YCXuqH_1BohqNFQyBdsbZyN7iWrtITaUdo_UGKprB0GB-BxaFB6KcG1m-xjee7-JDU06Uul33EfX1OwJm36WtCg3GRteTd9_sZSrtUTlL-b-OpfJ75mj5bf6Bu2Ns1P3RZ7iL-mo8X8bYT8EuA-W1c
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Constraint-Based+Concurrency+and+Beyond&rft.jtitle=Electronic+notes+in+theoretical+computer+science&rft.au=Ueda%2C+Kazunori&rft.date=2006-09-29&rft.pub=Elsevier+B.V&rft.issn=1571-0661&rft.eissn=1571-0661&rft.volume=162&rft.spage=327&rft.epage=331&rft_id=info:doi/10.1016%2Fj.entcs.2005.12.103&rft.externalDocID=S1571066106004567
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0661&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0661&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0661&client=summon