Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Andrés Aristizábal (1) , Filippo Bonchi (1) , Catuscia Palamidessi (1) , Luis Pino (1) , Frank D. Valencia (2, 1, 3)

1 COMETE - Concurrency, Mobility and Transactions
2 AVISPA Resarch Group - Ambientes VISuales de Progamación Aplicativa
3 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]

Concurrent 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 ones

Mots clés: Bisimilarity; Concurrent Constraint Programming; Labelled Semantics; Process Calculi

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, Frank D. Valencia. Deriving Labels and Bisimilarity for Concurrent Constraint Programming. FOSSACS 2011 : 14th International Conference on Foundations of Software Science and Computational Structures, Mar 2011, Saarbrücken, Germany. pp.138-152, ⟨10.1007/ISBN978-3-642-19804-5⟩. ⟨hal-00546722⟩