Skip to Main content Skip to Navigation
Journal articles

Observational and Behavioural Equivalences for Soft Concurrent Constraint Programming

Abstract : We present a labelled semantics for Soft Concurrent Constraint Programming (SCCP), a meta-language where concurrent agents may synchronise on a shared store by either posting or checking the satisfaction of (soft) constraints. SCCP generalises the classical formalism by parametrising the constraint system over an order-enriched monoid, thus abstractly representing the store with an element of the monoid, and the standard unlabelled semantics just observes store updates. The novel operational rules are shown to offer a sound and complete co-inductive technique to prove the original equivalence over the unlabelled semantics. Based on this characterisation, we provide an axiomatisation for finite agents.
Complete list of metadata

https://hal.inria.fr/hal-01675060
Contributor : Frank D. Valencia <>
Submitted on : Thursday, January 4, 2018 - 2:22:20 AM
Last modification on : Friday, April 30, 2021 - 9:59:37 AM

Identifiers

Collections

Citation

Fabio Gadducci, Francesco Santini, Luis Fernando Pino Duque, Frank Valencia. Observational and Behavioural Equivalences for Soft Concurrent Constraint Programming. Journal of Logical and Algebraic Methods in Programming, Elsevier, 2018, 92, pp.45-63. ⟨10.1016/j.jlamp.2017.06.001⟩. ⟨hal-01675060⟩

Share

Metrics

Record views

535