Automatic verification of timed concurrent constraint programs

The language Timed Concurrent Constraint (tccp) is the extension over time of the Concurrent Constraint Programming (cc) paradigm that allows us to specify concurrent systems where timing is critical, for example reactive systems. Systems which may have an infinite number of states can be specified...

Full description

Saved in:
Bibliographic Details
Published in:Theory and practice of logic programming Vol. 6; no. 3; pp. 265 - 300
Main Authors: FALASCHI, MORENO, VILLANUEVA, ALICIA
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.05.2006
Subjects:
ISSN:1471-0684, 1475-3081
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first