Concurrency, time, and constraints

Frank D. Valencia

doi:10.1007/978-3-540-24599-5_6

Concurrency, time, and constraints

Frank D. Valencia

Uppsala University

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

Résumé

Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in a shared medium. Timed (or temporal) ccp extends ccp by allowing agents to be constrained by time requirements.The novelty of timed ccp is that it combines in one framework an operational and algebraic view based upon process calculi with a declarative view based upon temporal logic. This allows the model to benefit from two well-established theories used in the study of concurrency. This essay offers an overview of timed ccp covering its basic background and central developments. The essay also includes an introduction to a temporal ccp formalism called the ntcc calculus.

langue originale	Anglais
Pages (de - à)	72-101
Nombre de pages	30
journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2916
Les DOIs	https://doi.org/10.1007/978-3-540-24599-5_6
état	Publié - 1 déc. 2003
Modification externe	Oui

Accès au document

10.1007/978-3-540-24599-5_6

Contient cette citation

@article{ffb33d8ff93a47618bf5d39b3acf2a63,

title = "Concurrency, time, and constraints",

abstract = "Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in a shared medium. Timed (or temporal) ccp extends ccp by allowing agents to be constrained by time requirements.The novelty of timed ccp is that it combines in one framework an operational and algebraic view based upon process calculi with a declarative view based upon temporal logic. This allows the model to benefit from two well-established theories used in the study of concurrency. This essay offers an overview of timed ccp covering its basic background and central developments. The essay also includes an introduction to a temporal ccp formalism called the ntcc calculus.",

author = "Valencia, \{Frank D.\}",

year = "2003",

month = dec,

day = "1",

doi = "10.1007/978-3-540-24599-5\_6",

language = "English",

volume = "2916",

pages = "72--101",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

}

TY - JOUR

T1 - Concurrency, time, and constraints

AU - Valencia, Frank D.

PY - 2003/12/1

Y1 - 2003/12/1

N2 - Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in a shared medium. Timed (or temporal) ccp extends ccp by allowing agents to be constrained by time requirements.The novelty of timed ccp is that it combines in one framework an operational and algebraic view based upon process calculi with a declarative view based upon temporal logic. This allows the model to benefit from two well-established theories used in the study of concurrency. This essay offers an overview of timed ccp covering its basic background and central developments. The essay also includes an introduction to a temporal ccp formalism called the ntcc calculus.

AB - Concurrent constraint programming (ccp) is a model of concurrency for systems in which agents (also called processes) interact with one another by telling and asking information in a shared medium. Timed (or temporal) ccp extends ccp by allowing agents to be constrained by time requirements.The novelty of timed ccp is that it combines in one framework an operational and algebraic view based upon process calculi with a declarative view based upon temporal logic. This allows the model to benefit from two well-established theories used in the study of concurrency. This essay offers an overview of timed ccp covering its basic background and central developments. The essay also includes an introduction to a temporal ccp formalism called the ntcc calculus.

U2 - 10.1007/978-3-540-24599-5_6

DO - 10.1007/978-3-540-24599-5_6

M3 - Article

AN - SCOPUS:0346264999

SN - 0302-9743

VL - 2916

SP - 72

EP - 101

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -

Concurrency, time, and constraints

Résumé

Accès au document

Empreinte digitale

Contient cette citation