TY - GEN
T1 - Deriving labels and bisimilarity for concurrent constraint programming
AU - Aristizábal, Andrés
AU - Bonchi, Filippo
AU - Palamidessi, Catuscia
AU - Pino, Luis
AU - Valencia, Frank
N1 - Funding Information:
This work has been partially supported by the project ANR-09-BLAN-0169-01 PANDA and by the INRIA DRI Equipe Associée FORCES.
PY - 2011
Y1 - 2011
N2 - Concurrent constraint programming (ccp) is a well-established model for concurrency. 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.
AB - Concurrent constraint programming (ccp) is a well-established model for concurrency. 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.
UR - https://www.scopus.com/pages/publications/79953199079
U2 - 10.1007/978-3-642-19805-2_10
DO - 10.1007/978-3-642-19805-2_10
M3 - Conference contribution
AN - SCOPUS:79953199079
SN - 9783642198045
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 138
EP - 152
BT - Foundations of Software Science and Computational Structures - 14th Int. Conf., FOSSACS 2011, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2011, Proceedings
PB - Springer Verlag
ER -