Bridging the gap between two concurrent constraint languages

Authors:
Alexei Lescaylle;Alicia Villanueva
Affiliations:
DSIC, Universidad Politécnica de Valencia, Valencia, Spain;DSIC, Universidad Politécnica de Valencia, Valencia, Spain
Venue:
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
Year:
2010

Citing 11
Cited 1

LUSTRE: a declarative language for real-time programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the development of reactive systems

Logics and models of concurrent systems
Concurrent constraint programming

Concurrent constraint programming
A timed concurrent constraint language

Information and Computation
On the expressive power of temporal concurrent constraint programming languages

Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Temporal concurrent constraint programming: denotation, logic and applications

Nordic Journal of Computing
Operational and Compositional Semantics of Synchronous Automaton Compositions

CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
A semantic framework for the abstract model checking of tccp programs

Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Universal concurrent constraint programing: symbolic semantics and applications to security

Proceedings of the 2008 ACM symposium on Applied computing
The expressivity of universal timed CCP: undecidability of Monadic FLTL and closure operators for security

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
The tccp Interpreter

Electronic Notes in Theoretical Computer Science (ENTCS)

Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Concurrent Constraint Paradigm (cc in short) is a simple and highly expressive formalism for modeling concurrent systems where agents execute asynchronously, interacting among them by adding and consulting constraints in a global store. The cc model replaces the notion of store-as-valuation with the notion of store-as-constraint. There exist several programming languages that extend the cc model by introducing a notion of time. The notion of time allows us to represent concurrent and reactive systems. The different definitions for time make each language better suited for modeling a specific kind of application (deterministic embedded systems, non-deterministic reactive systems, etc.). This paper studies the relation between the universal timed concurrent constraint language (utcc in short) and the timed concurrent constraint language (tccp). We show how utcc can be mapped into tccp by means of a transformation that preserves the original behavior. We also prove the correctness of the transformation.