• Concurrency, time, and constra...

Treffer: Concurrency, time, and constraints

Title:
Concurrency, time, and constraints
Authors:
VALENCIA, Frank D
Source:
Logic programming (Mumbai, 9-13 December 2003)Lecture notes in computer science. :72-101
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 53 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Algèbre processus, Process algebra, Algebra proceso, En ligne, On line, En línea, Logique temporelle, Temporal logic, Lógica temporal, Nouveauté, Novelty, Novedad, Programmation logique, Logical programming, Programación lógica, Simultanéité informatique, Concurrency, Simultaneidad informatica, Système multiagent, Multiagent system, Sistema multiagente, Système réactif, Reactive system, Sistema reactivo, Programmation concurrente par contrainte, Concurrent constraint programming, Programación concurrrente con restricción
Document Type:
Konferenz Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dept. of Information Technology, Uppsala University, Box 337, 751 05 Uppsala, Sweden
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=15758596
Rights:
Copyright 2004 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15758596
Database:
PASCAL Archive

Weitere Informationen

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.