Foundations of Timed Concurrent Constraint Programming

We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of process algebras, we develop some combinators expressible in this model, and reconcile their operational, logical and denotational character. We show how programs may be compiled into finite-state machines with loop-free computations at each state, thus guaranteeing bounded response time.

• Type: Conference
• Year: 1994
• Where: LICS
• Authors: Vijay A. Saraswat, Radha Jagadeesan, Vineet Gupta
• Keywords: Automated Reasoning, Constraint Programming Model, LICS 1994, Loop-free Computations, Reactive Computation