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
Document type :
Conference papers
Martin Hofmann. FOSSACS 2011 : 14th International Conference on Foundations of Software Science and Computational Structures, Mar 2011, Saarbrücken, Germany. Springer, 6604, pp.138-152, 2011, Lecture Notes in Computer Science. 〈10.1007/ISBN 978-3-642-19804-5〉
Liste complète des métadonnées

Cited literature [30 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00546722
Contributor : Frank D. Valencia <>
Submitted on : Tuesday, December 14, 2010 - 4:23:47 PM
Last modification on : Wednesday, November 14, 2018 - 4:10:03 PM
Document(s) archivé(s) le : Monday, November 5, 2012 - 1:40:49 PM

File

FOSSACS11_ABPPV_.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis Pino, Frank Valencia. Deriving Labels and Bisimilarity for Concurrent Constraint Programming. Martin Hofmann. FOSSACS 2011 : 14th International Conference on Foundations of Software Science and Computational Structures, Mar 2011, Saarbrücken, Germany. Springer, 6604, pp.138-152, 2011, Lecture Notes in Computer Science. 〈10.1007/ISBN 978-3-642-19804-5〉. 〈hal-00546722〉

Share

Metrics

Record views

675

Files downloads

139