Deriving Labels and Bisimilarity for Concurrent Constraint Programming - Archive ouverte HAL Access content directly
Conference Papers Year : 2011

Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Abstract

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
Fichier principal
Vignette du fichier
FOSSACS11_ABPPV_.pdf (226.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00546722 , version 1 (14-12-2010)

Identifiers

Cite

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⟩
284 View
155 Download

Altmetric

Share

Gmail Facebook X LinkedIn More