A Labelled Semantics for Soft Concurrent Constraint Programming - Coordination Models and Languages Access content directly
Conference Papers Year : 2015

A Labelled Semantics for Soft Concurrent Constraint Programming

Abstract

We present a labelled semantics for Soft Concurrent Constraint Programming (SCCP), a language where concurrent agents may synchronize on a shared store by either posting or checking the satisfaction of (soft) constraints. SCCP generalizes the classical formalism by parametrising the constraint system over an order-enriched monoid: the monoid operator is not required to be idempotent, thus adding the same information several times may change the store. The novel operational rules are shown to offer a sound and complete co-inductive technique to prove the original equivalence over the unlabelled semantics
Fichier principal
Vignette du fichier
coordination15.pdf (162.45 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01149227 , version 1 (06-05-2015)

Identifiers

Cite

Fabio Gadducci, Francesco Santini, Luis Pino, Frank Valencia. A Labelled Semantics for Soft Concurrent Constraint Programming. 17th International Conference on Coordination Languages and Models (COORDINATION), Jun 2015, Grenoble, France. pp.133-149, ⟨10.1007/978-3-319-19282-6_9⟩. ⟨hal-01149227⟩
232 View
221 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More