DocumentCode :
1996672
Title :
Foundations of timed concurrent constraint programming
Author :
Saraswat, Vijay A. ; Jagadeesan, Radha ; Gupta, Vineet
Author_Institution :
Syst. & Practices Lab., Xerox Palo Alto Res. Center, CA, USA
fYear :
1994
fDate :
4-7 Jul 1994
Firstpage :
71
Lastpage :
80
Abstract :
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
Keywords :
constraint handling; finite state machines; parallel programming; bounded response time; denotational character; finite-state machines; loop-free computations; process algebras; reactive computation; timed concurrent constraint programming; Algebra; Automata; Computer languages; Computer science; Concurrent computing; Control systems; Equations; Maintenance; Modular construction; Time factors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on
Conference_Location :
Paris
Print_ISBN :
0-8186-6310-3
Type :
conf
DOI :
10.1109/LICS.1994.316085
Filename :
316085
Link To Document :
بازگشت