A simulator for tccp in Mozart
Number of Authors: 3
2001 (English)Other (Other academic)
The concurrent constraint-programming paradigm, ccp provides convenient synchronisation mechanisms for many distributed algorithms. tccp is defined as a timed extension of ccp usable for reactive systems. We show how tccp can be compiled and interpreted in the distributed multi-paradigm programming system Mozart-Oz.
Place, publisher, year, edition, pages
Swedish Institute of Computer Science/KTH , 2001, 1.
Computer and Information Science
IdentifiersURN: urn:nbn:se:ri:diva-22659OAI: oai:DiVA.org:ri-22659DiVA: diva2:1042224
Technical Note presented at the meeting of the ESPRIT working group COTIC. Nantes, France, January 21, 2001. Frank de Boer (organizer).2016-10-312016-10-31Bibliographically approved