Open AccessDeriving Labels and Bisimilarity for Concurrent Constraint Programming
Author(s) -
Diana Hermith,
Carlos Olarte,
Camilo Rueda,
Frank D. Valencia
Publication year - 2011
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1007/isbn
Subject(s) - concurrent constraint logic programming , computer science , programming language , constraint programming , constraint (computer aided design) , constraint satisfaction , theoretical computer science , constraint satisfaction problem , inductive programming , programming paradigm , artificial intelligence , mathematical optimization , functional logic programming , mathematics , geometry , probabilistic logic , stochastic programming
International audienceConcurrent constraint programming (ccp) is a well-established model for concurrency that builds upon operational and algebraic notions from process calculi and first-order logic. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity, however, is not completely satisfactory for ccp since it yields an equivalence that is too fine grained. By building upon recent foundational investigations, we introduce a labelled transition semantics and a novel notion of bisimilarity that is fully abstract w.r.t. the typical observational equivalence in ccp. This way we provide ccp with a new proof technique for ccp coherent with existing one