Deriving labels and bisimilarity for concurrent constraint programming

Authors:
Andrés Aristizábal;Filippo Bonchi;Catuscia Palamidessi;Luis Pino;Frank Valencia
Affiliations:
Comète, LIX, Laboratoire de l'École Polytechnique associé à l'INRIA;CNRS - Laboratoire de l'Informatique du Parallélisme, ENS Lyon;Comète, LIX, Laboratoire de l'École Polytechnique associé à l'INRIA;Comète, LIX, Laboratoire de l'École Polytechnique associé à l'INRIA;Comète, LIX, Laboratoire de l'École Polytechnique associé à l'INRIA
Venue:
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Year:
2011

Citing 25
Cited 3

Concurrent constraint programming

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The semantic foundations of concurrent constraint programming

POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Dynamic congruence vs. progressing bisimulation for CCS

Fundamenta Informaticae - Special issue on mathematical foundations of computer science '91
On reduction-based process semantics

Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Nondeterminism and infinite computations in constraint programming

Selected papers of the workshop on Topology and completion in semantics
Domain theory

Handbook of logic in computer science (vol. 3)
Confluence in concurrent constraint programming

Theoretical Computer Science - Special issue on algebraic methodology and software technology
Communicating and mobile systems: the &pgr;-calculus

Communicating and mobile systems: the &pgr;-calculus
A logical view of concurrent constraint programming

Nordic Journal of Computing
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
From Rewrite to Bisimulation Congruences

CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Deriving Bisimulation Congruences for Reactive Systems

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
On Bisimulations for the Asynchronous pi-Calculus

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Concurrent constraint programming languages

Concurrent constraint programming languages
Reactive Systems over Cospans

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
On the Expressiveness of Linearity vs Persistence in the Asychronous Pi-Calculus

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Saturated Semantics for Reactive Systems

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Reactive Systems, Barbed Semantics, and the Mobile Ambients

FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Minimization Algorithm for Symbolic Bisimilarity

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Psi-calculi: Mobile Processes, Nominal Data, and Logic

LICS '09 Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science
Semantic barbs and biorthogonality

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
RPO, second-order contexts, and λ-calculus

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Open bisimulation for the concurrent constraint pi-calculus

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Weak Equivalences in Psi-Calculi

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
A Calculus of Contracting Processes

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science

Partition refinement for bisimilarity in CCP

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Efficient computation of program equivalence for confluent concurrent constraint programming

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Models and emerging trends of concurrent constraint programming

Constraints

Quantified Score

Hi-index	0.00

Visualization

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.