Observational and behavioural equivalences for soft concurrent constraint programming

Fabio Gadducci, Francesco Santini, Luis F. Pino, Frank D. Valencia

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

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.

Original languageEnglish
Pages (from-to)45-63
Number of pages19
JournalJournal of Logical and Algebraic Methods in Programming
Volume92
DOIs
StatePublished - Nov 2017

Fingerprint

Dive into the research topics of 'Observational and behavioural equivalences for soft concurrent constraint programming'. Together they form a unique fingerprint.

Cite this