Observational and Behavioural Equivalences for Soft Concurrent Constraint Programming - Archive ouverte HAL Access content directly
Journal Articles Journal of Logical and Algebraic Methods in Programming Year : 2018

Observational and Behavioural Equivalences for Soft Concurrent Constraint Programming

(1) , (2) , (3, 4) , (4)
1
2
3
4

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.

Dates and versions

hal-01675060 , version 1 (04-01-2018)

Identifiers

Cite

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, 2018, 92, pp.45-63. ⟨10.1016/j.jlamp.2017.06.001⟩. ⟨hal-01675060⟩
358 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More