A Symbolic Model for Timed Concurrent Constraint Programming

Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification...

Full description

Saved in:
Bibliographic Details
Published in:Electronic notes in theoretical computer science Vol. 312; pp. 161 - 177
Main Authors: Arias, Jaime, Guzmán, Michell, Olarte, Carlos
Format: Journal Article
Language:English
Published: Elsevier B.V 24.04.2015
Subjects:
ISSN:1571-0661, 1571-0661
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