Deriving labels and bisimilarity for concurrent constraint programming

DOI10.1007/978-3-642-19805-2_10zbMATH Open1326.68196OpenAlexW1585676371MaRDI QIDQ3000605FDOQ3000605

Authors: Andrés Aristizábal, Filippo Bonchi, Catuscia Palamidessi, Luis F. Pino, Frank D. Valencia 

Publication date: 19 May 2011

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19805-2_10

Recommendations

• Bisimilarity in concurrent constraint programming
• A behavioral congruence for concurrent constraint programming with nondeterministic choice
• Reducing weak to strong bisimilarity in CCP
• Truly concurrent constraint programming
• Open Bisimulation for the Concurrent Constraint Pi-Calculus

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (11)

• A General Theory of Barbs, Contexts, and Labels
• Reducing weak to strong bisimilarity in CCP
• Open Bisimulation for the Concurrent Constraint Pi-Calculus
• Reasoning about distributed information with infinitely many agents
• Characterizing right inverses for spatial constraint systems with applications to modal logic
• A behavioral congruence for concurrent constraint programming with nondeterministic choice
• Models and emerging trends of concurrent constraint programming
• Belief, knowledge, lies and other utterances in an algebra for space and extrusion
• Observational and behavioural equivalences for soft concurrent constraint programming
• A theory of bisimulation for a fragment of concurrent ML with local names
• Bisimilarity in concurrent constraint programming

This page was built for publication: Deriving labels and bisimilarity for concurrent constraint programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000605)