Deriving labels and bisimilarity for concurrent constraint programming

Andrés Aristizábal; Filippo Bonchi; Catuscia Palamidessi; Luis Pino; Frank Valencia

doi:10.1007/978-3-642-19805-2_10

Deriving labels and bisimilarity for concurrent constraint programming

Andrés Aristizábal
, Filippo Bonchi
, Catuscia Palamidessi
, Luis Pino
, Frank Valencia

Laboratoire d'Informatique (LIX)
Ecole Normale Supérieure de Lyon

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

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.

langue originale	Anglais
titre	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
Editeur	Springer Verlag
Pages	138-152
Nombre de pages	15
ISBN (imprimé)	9783642198045
Les DOIs	https://doi.org/10.1007/978-3-642-19805-2_10
état	Publié - 1 janv. 2011

Série de publications

Nom	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6604 LNCS
ISSN (imprimé)	0302-9743
ISSN (Electronique)	1611-3349

Accès au document

10.1007/978-3-642-19805-2_10

Contient cette citation

Aristizábal, A., Bonchi, F., Palamidessi, C., Pino, L., & Valencia, F. (2011). Deriving labels and bisimilarity for concurrent constraint programming. Dans 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 (p. 138-152). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 6604 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-642-19805-2_10

Aristizábal, Andrés ; Bonchi, Filippo ; Palamidessi, Catuscia et al. / Deriving labels and bisimilarity for concurrent constraint programming. 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. Springer Verlag, 2011. p. 138-152 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{fe73ab19c662454492c5d24dda0c22c3,

title = "Deriving labels and bisimilarity for concurrent constraint programming",

abstract = "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.",

author = "Andr{\'e}s Aristiz{\'a}bal and Filippo Bonchi and Catuscia Palamidessi and Luis Pino and Frank Valencia",

year = "2011",

month = jan,

day = "1",

doi = "10.1007/978-3-642-19805-2\_10",

language = "English",

isbn = "9783642198045",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "138--152",

booktitle = "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",

}

Aristizábal, A, Bonchi, F, Palamidessi, C, Pino, L & Valencia, F 2011, Deriving labels and bisimilarity for concurrent constraint programming. Dans 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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOL. 6604 LNCS, Springer Verlag, p. 138-152. https://doi.org/10.1007/978-3-642-19805-2_10

Deriving labels and bisimilarity for concurrent constraint programming. / Aristizábal, Andrés; Bonchi, Filippo; Palamidessi, Catuscia et al.
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. Springer Verlag, 2011. p. 138-152 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 6604 LNCS).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

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

PY - 2011/1/1

Y1 - 2011/1/1

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.

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 -

Aristizábal A, Bonchi F, Palamidessi C, Pino L, Valencia F. Deriving labels and bisimilarity for concurrent constraint programming. Dans 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. Springer Verlag. 2011. p. 138-152. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-19805-2_10

Deriving labels and bisimilarity for concurrent constraint programming

Résumé

Série de publications

Accès au document

Empreinte digitale

Contient cette citation