Observational and behavioural equivalences for soft concurrent constraint programming

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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of logical and algebraic methods in programming Ročník 92; s. 45 - 63
Hlavní autoři:	Gadducci, Fabio, Santini, Francesco, Pino, Luis F., Valencia, Frank D.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier 01.11.2017
Témata:	Computer Science Distributed, Parallel, and Cluster Computing Logic in Computer Science Soft Constraints Semantics of Programming Langages Concurrent Constraint Programming
ISSN:	2352-2208
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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.
ISSN:	2352-2208
DOI:	10.1016/j.jlamp.2017.06.001