A Timed Concurrent Constraint Language

Boer, Frank S. de; Gabbrielli, Maurizio; Meo, Maria Chiara

doi:10.1006/inco.1999.2879

Cited by 69 publications

(112 citation statements)

References 15 publications

Supporting

Mentioning

112

Contrasting

Order By: Relevance

“…The Timed Concurrent Constraint Language (tccp in short) is a declarative language introduced in [3] to model concurrent and reactive systems. The language inherits all the features of the cc paradigm, including non-determinism and the monotonicity of the store.…”

Section: Timed Concurrent Constraint Languagementioning

confidence: 99%

“…Different consults and/or updates in parallel take one single time instant. Let us briefly recall the syntax of tccp [3]. A tccp program P is an object of the form D.A, where D is a set of procedure declarations of the form p( x) : − A, and A is an agent:…”

Section: Timed Concurrent Constraint Languagementioning

confidence: 99%

“…In the literature, we find several programming languages resulting from this temporal extension. In this work, we deal with two of them: the Timed Concurrent Constraint language (tccp) of F. de Boer et al [3], and the more recent Universal Timed Concurrent Constraint language (utcc) of C. Olarte and F. Valencia [14].…”

Section: Introductionmentioning

confidence: 99%

“…The expressive power of temporal concurrent constraint languages has been previously studied [3,[11][12][13]17]. In [17] it is proven that the temporal language defined in [5] embeds the synchronous data flow language Lustre [4] (restricted to finite value types), and also the asynchronous state oriented language Argos [10].…”

Section: Introductionmentioning

confidence: 99%

“…Moreover, the strong abortion mechanism of Esterel can also be encoded in this language. In [3] it is shown that the notion of maximal parallelism of tccp is more expressive than the notion of interleaving parallelism of other concurrent constraint languages. Regarding the utcc language, it is shown Turing complete in [13].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Bridging the Gap between Two Concurrent Constraint Languages

Lescaylle

Villanueva

2011

Functional and Constraint Logic Programming

View full text Add to dashboard Cite

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.

show abstract

Section: Timed Concurrent Constraint Languagementioning

confidence: 99%

Section: Timed Concurrent Constraint Languagementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Bridging the Gap between Two Concurrent Constraint Languages

Lescaylle

Villanueva

2011

Functional and Constraint Logic Programming

View full text Add to dashboard Cite

show abstract

A Symbolic Model Checker for tccp Programs

Alpuente

Falaschi

Villanueva

2005

Rapid Integration of Software Engineering Techniques

View full text Add to dashboard Cite

Compositional Verification of Asynchronous Processes via Constraint Solving

Delzanno

Gabbrielli

2005

Automata, Languages and Programming

View full text Add to dashboard Cite

Abstract. In this paper we investigate the foundations of a constraintbased compositional verification method for infinite-state systems. We first consider an asynchronous process calculus which is an abstract formalization of several existing languages based on the blackboard model. For this calculus we define a contraint-based symbolic representation of a compositional model based on traces. The constraint system we use combines formulas of integer arithmetics with equalities over uninterpreted function symbols in which satisfiability is decidable. The translation is inductively defined via a CLP program. Execution traces of a process can be compositionally obtained from the solutions of the answer constraints of the CLP encoding. This way, the task of compositional verification can be reduced to constraint computing and solving.

show abstract

A Timed Concurrent Constraint Language

Cited by 69 publications

References 15 publications

Bridging the Gap between Two Concurrent Constraint Languages

Bridging the Gap between Two Concurrent Constraint Languages

A Symbolic Model Checker for tccp Programs

Compositional Verification of Asynchronous Processes via Constraint Solving

Contact Info

Product

Resources

About