Change search
ReferencesLink to record
Permanent link

Direct link
A simulator for tccp in Mozart
Number of Authors: 3
2001 (English)Other (Other academic)
Abstract [en]

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.
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14847OAI: diva2:1036141
Technical Note presented at the meeting of the ESPRIT working group COTIC. Nantes, France, January 21, 2001. Frank de Boer (organizer).Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(47 kB)2 downloads
File information
File name FULLTEXT01.gzFile size 47 kBChecksum SHA-512
Type fulltextMimetype application/x-gzip

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link