Timed Default Concurrent Constraint Programming

  title={Timed Default Concurrent Constraint Programming},
  author={Vijay A. Saraswat and Radha Jagadeesan and Vineet Gupta},
  journal={J. Symb. Comput.},
Abstract Synchronous programming (Berry, 1989) is a powerful approach to programming reactive systems. Following the idea that “processes are relations extended over time” (Abramsky, 1993), we propose a simple but powerful model for timed, determinate computation, extending the closure-operator model for untimed concurrent constraint programming (CCP). In Saraswat et al . (1994a) we had proposed a model for this called tcc—here we extend the model of tcc to express strong time-outs: if an event… 

Reactive Constraint Programming

An extension of tcc that allows the specification of nondeterministic computation, called the ntcc model, which is based upon ideas from both concurrent constraint programming and CCS-like models and claims the applicability of ntCC by modeling reactive system examples of RCX controllers.

Timed soft concurrent constraint programs: An interleaved and a parallel approach

This paper provides a language to describe the agents' behavior, together with its operational and denotational semantics, and describes a version for their interleaving on a single processor (with maximal parallelism for time elapsing).

Temporal Concurrent Constraint Programming: Denotation, Logic and Applications

This work presents a model of temporal concurrent constraint programming which adds to tcc the capability of modeling asynchronous and nondeterministic timed behavior, and calls this tcc extension the ntcc calculus, which gives a denotational semantics for the strongest-postcondition of ntCC processes.

An Assertion language for slicing Constraint Logic Languages

This paper provides an assertion language suitable for both, CCP and CLP, which allows the user to specify some properties of the computations in her program and shows that the framework can be integrated with the previous semi-automatic one, giving the user more choices and flexibility.

A Timed Concurrent Constraint Language

It is shown that tccp is strictly more expressive than ccpm which, in its turn, is strictlyMore expressive than ccp .

An Abstract Interpretation Framework for Verification of Timed Concurrent Constraint Languages

The Timed Concurrent Constrain programming (tccp in short) is a concurrent logic language obtained by extending the cc paradigm with the notion of time and a suitable mechanism to model time-outs and preemptions and is a suitable language to model both concurrent and reactive systems.

Time Limited Model Checking

An automatic transformation from Hybrid cc Structures to linear hybrid automata is presented, and thus standard model checkers working on timed automata, such as HyTech, can be used in order to verify properties of hybrid systems.

Timed Soft Concurrent Constraint Programs

This paper provides a language to describe the agents behavior, together with its operational and denotational semantics, for which it is proved the compositionality and correctness properties.

A Proof Theoretic Study of Soft Concurrent Constraint Programming

This work obtains a CCP language where agents can tell and ask soft constraints and proves that the language in (1) has a strong connection with logic, and gives a proof theoretical meaning to soft constraints: they can be defined as formulas in a suitable fragment of ILL with subexponentials (SELL) where subexp onentials are interpreted as preferences.

Declarative Priority in a Concurrent Logic Language ON

A model of priority is defined and some properties of the model are proved, and a concurrent logic language called ON is designed based on the theoretical framework and some prominent characteristics that are embodied in sample programs written in ON are discussed.



Default timed concurrent constraint programming

The model of [SJG94b] is extended to express strong time-outs (and pre-emption) and provides a simple and natural model capable of representing the full range ofPre-emption constructs supported in ESTEREL, LUSTRE and other synchronous programming languages.

The semantic foundations of concurrent constraint programming

The basic ideas involved in giving a coherent semantic account of concurrent constraint programming are developed, including a simple and general formulation of the notion that a constraint system is a system of partial information.

The Esterel Synchronous Programming Language: Design, Semantics, Implementation

Concurrent constraint programming

This paper presents a new and very rich class of (concurrent) programming languages, based on the notion of computing with partial information, and the concomitant notions of consistency and entailment, and develops the cc family of languages, which is very similar to Milner's CCS.

Logics and Models of Concurrent Systems

  • K. Apt
  • Computer Science
    NATO ASI Series
  • 1985
A logic for the specification and proof of controllable processes of CCS and specification-oriented programming in TCSP and the theory of knowledge and ignorance in expert systems.

Foundations of timed concurrent constraint programming

This work develops a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way and shows how programs may be compiled into finite-state machines with loop-free computations at each state, thus guaranteeing bounded response time.

Synchronous Programming of Reactive Systems

This book presents a synthesis of recent works concerning reactive system design, based on Robin Milner's pioneering works about synchronous process algebras, which consists in considering that a program instantaneously reacts to events, or that the machine execution time is negligible with respect to the response delays of its environment.

Computing with Continuous Change

Constraint processing in cc(fd)

It is shown that some basic constraint operations currently hardwired into constraint solvers can be abstracted and made available as combinators in the programming language and this allows complex constraintsolvers to be decomposed into logically clean and e ciently implementable cc programs over a much simpler constraint system.

A fully abstract semantics for a first-order functional language with logic variables

This paper presents a first-order functional language with logic variables and gives its meaning using a structural operational semantics and gives it a denotational semantics, using a novel technique involving closure operators on a Scott domain.