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 denota...
Saved in:
| Published in: | Logic in Computer Science, 9th Annual IEEE Symposium pp. 71 - 80 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE Comput. Soc. Press
1994
|
| Subjects: | |
| ISBN: | 9780818663109, 0818663103 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

