A labelled semantics for Soft Concurrent Constraint Programming
Post date: 03-Apr-2015 08:36:19
Upcoming paper (to appear in COORDINATION 2015)
F. Gadducci, F. Santini, L. F. Pino, F. D. Valencia
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.