Timed Soft Concurrent Constraint Programs

We propose a timed and soft extension of Concurrent Con- straint Programming that we call Timed Soft Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: computation takes a bounded period of time and is mea-sured by a discrete global clock. Action prefixing is then considered as the syntactic marker which distinguishes a time instant from the next one. Supported by soft constraints instead of crisp ones, tel l and ask agents are now equipped with a preference (or consistency) threshold which is used to determine their success or suspension. In the paper we provide a language to describe the agents behavior, together with its operational and denotational semantics, for which we also prove the compositionality and correctness properties. Agents negotiating Quality of Service can benefit from this new language, by synchronizing among themselves and mediating their preferences.