Skip to main content
Conference Proceedings

Capturing fair computations on concurrent constraint language

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5649 LNCS 559-560
DOI: 10.1007/978-3-642-02846-5_63
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper contains an extension of the Concurrent Constraint language (CC) in order to guarantee a fair criterion of selection among parallel agents and to restrict or remove the possible unwanted behavior of a program. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Campli, P., & Bistarelli, S. (2009). Capturing fair computations on concurrent constraint language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5649 LNCS, pp. 559–560). https://doi.org/10.1007/978-3-642-02846-5_63

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free