Skip to Main content Skip to Navigation

Universal Temporal Concurrent Constraint Programming

Carlos Olarte 1
1 COMETE - Concurrency, Mobility and Transactions
Inria Saclay - Ile de France, LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
Abstract : Concurrent Constraint Programming (CCP) is a formalism for concurrency in which agents (processes) interact with one another by telling (adding) and asking (reading) information represented as constraints in a shared medium (the store). Temporal Concurrent Constraint Programming (tcc) extends CCP by allowing agents to be constrained by time conditions. This dissertation studies temporal CCP as a model of concurrency for mobile, timed reactive systems. The study is conducted by developing a process calculus called utcc, Universal Temporal CCP. The thesis is that utcc is a model for concurrency where behavioral and declarative reasoning techniques coexist coherently, thus allowing for the specification and verification of mobile reactive systems in emergent application areas. The utcc calculus generalizes tcc, a temporal CCP model of reactive synchronous programming, with the ability to express mobility. Here mobility is understood as communication of private names as typically done for mobile systems and security protocols. The utcc calculus introduces parametric ask operations called abstractions that behave as persistent parametric asks during a time-interval but may disappear afterwards. The applicability of the calculus is shown in several domains of Computer Science. Namely, decidability of Pnueli's First-order Temporal Logic, closure-operator semantic characterization of security protocols, semantics of a Service-Oriented Computing language, and modeling of Dynamic Multimedia-Interaction systems.
Document type :
Complete list of metadatas

Cited literature [91 references]  Display  Hide  Download
Contributor : Catuscia Palamidessi <>
Submitted on : Friday, November 6, 2009 - 6:17:04 PM
Last modification on : Wednesday, March 27, 2019 - 4:41:28 PM
Long-term archiving on: : Tuesday, October 16, 2012 - 1:26:23 PM


  • HAL Id : tel-00430446, version 1



Carlos Olarte. Universal Temporal Concurrent Constraint Programming. Modeling and Simulation. Ecole Polytechnique X, 2009. English. ⟨tel-00430446⟩



Record views


Files downloads