Models for Concurrent Constraint Programming
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
Concurrent Constraint Programming (CCP) is a simple but
powerful framework for computation based on four basic computational
ideas: concurrency (multiple agents are simultaneously
active), communication (they interact via the monotonic
accumulation of constraints on shared variables),
coordination (the presence or absence of information can guard
evolution of an agent), and localization (each agent has
access to only a finite, though dynamically varying, number of
variables, and can create new variables on the fly). Unlike
other foundational models of concurrency such as CCS, CSP,
Petri nets and the pi-calculus, such flexibility is already
made available within the context of determinate
computation. This allows the development of a rich and
tractable theory of concurrent processes within the context of
which additional computational notion such as indeterminacy,
reactivity, instantaneous interrupts and continuous
(dense-time) autonomous evolution have been developed.
We survey the development of some of these extensions and the
relationships between their semantic models.
© Springer Verlag, 1996. Published in the
Lecture Notes in Computer Science Series.
title = "Models for Concurrent Constraint Programming",
author = " Vineet Gupta and Radha Jagadeesan and Vijay Saraswat"
pages = "66--83",
booktitle = "CONCUR~'96: Concurrency Theory, 7th International
editor = "Ugo Montanari and Vladimiro Sassone",
address = "Pisa, Italy",
month = "26--29~" # aug,
year = "1996",
series = "Lecture Notes in Computer Science",
volume = "1119",
publisher = "Springer-Verlag"
Postscript file (207K)
Pdf file (174K)