A timed concurrent constraint language.

DOI10.1006/inco.1999.2879zbMath1046.68507OpenAlexW1981281472MaRDI QIDQ1854359

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

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2879

zbMATH Keywords

maximal parallelismtccp

Mathematics Subject Classification ID

Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (19)

On concurrent behaviors and focusing in linear logic ⋮ Expired data collection in shared dataspaces. ⋮ A program analysis framework for \textit{tccp} based on abstract interpretation ⋮ A Proof Theoretic Study of Soft Concurrent Constraint Programming ⋮ Abstract Diagnosis for tccp using a Linear Temporal Logic ⋮ Slicing concurrent constraint programs ⋮ Abstract interpretation of temporal concurrent constraint programs ⋮ Timed soft concurrent constraint programs: An interleaved and a parallel approach ⋮ Bridging the Gap between Two Concurrent Constraint Languages ⋮ Semantics of temporal constrained objects ⋮ A symbolic model for timed concurrent constraint programming ⋮ Decidability of infinite-state timed CCP processes and first-order LTL ⋮ Decidability properties for fragments of CHR ⋮ Abstract Analysis of Universal Properties for tccp ⋮ Comparative analysis of the expressiveness of shared dataspace coordination ⋮ A semantic framework for the abstract model checking of tccp programs ⋮ A timed concurrent constraint language. ⋮ A Framework for Timed Concurrent Constraint Programming with External Functions ⋮ Models and emerging trends of concurrent constraint programming

Uses Software

• Oz
• LUSTRE
• Esterel

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Timed default concurrent constraint programming
• Executable temporal logics
• Statecharts: a visual formalism for complex systems
• From failure to success: Comparing a denotational and a declarative semantics for Horn clause logic
• The Esterel synchronous programming language: Design, semantics, implementation
• The expressive power of indeterminate dataflow primitives
• Weak relative pseudo-complements of closure operators
• Embedding as a tool for language comparison
• A process algebra of communicating shared resources with dense time and priorities
• A timed concurrent constraint language.
• A process algebra for timed systems
• Timing and causality in process algebra
• Real time process algebra
• Confluence in concurrent constraint programming

This page was built for publication: A timed concurrent constraint language.