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
Identifiers
URN: urn:nbn:se:ri:diva-22659OAI: oai:DiVA.org:ri-22659DiVA: diva2:1042224
Note
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-31 Created: 2016-10-31

Open Access in DiVA

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

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 1 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

Total: 8 hits
ReferencesLink to record
Permanent link

Direct link