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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Francez, N.: FAIRNESS (text and monographs in computer science). Springer, Heidelberg (1986)
Fagin, R., Williams, J.H.: A Fair Carpool Scheduling Algorithm, International Business Machine Corporation, pp. 133–139 (1983)
Saraswat, V.A., Rinard, M.: Concurrent constraint programming. In: POPL 1990 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Campli, P., Bistarelli, S. (2009). Capturing Fair Computations on Concurrent Constraint Language. In: Hill, P.M., Warren, D.S. (eds) Logic Programming. ICLP 2009. Lecture Notes in Computer Science, vol 5649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02846-5_63
Download citation
DOI: https://doi.org/10.1007/978-3-642-02846-5_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02845-8
Online ISBN: 978-3-642-02846-5
eBook Packages: Computer ScienceComputer Science (R0)