Temporal Concurrent Constraint Programming
The temporal ccp model tcc  is aimed at specifying timed systems. Time is conceptually divided into discrete intervals. In a particular time interval, a ccp process receives a stimulus (i.e. a constraint)from the environment, it executes with this stimulus as the initial store, and when it reaches its resting point, it responds to the environment with the resulting store. Also the resting point determines a residual process, which is then executed in the next time interval. This temporal ccp model is inherently deterministic and synchronous.
- 1.M. Nielsen and F. Valencia. Temporal concurrent constraint programming:Applications and behavior. Technical report, BRICS, August 2001.Google Scholar
- 2.C. Palamidessi and F. Valencia. A temporal concurrent constraint programming calculus. In Proc. of the Seventh International Conference on Principles and Practice of Constraint Programming, 26 November 2001.Google Scholar
- 3.V. Saraswat, R. Jagadeesan, and V. Gupta. Foundations of timed concurrent constraint programming. In Proc. of the Ninth Annual IEEE Symposium on Logic in Computer Science, pages 71–80, 4-7 July 1994.Google Scholar