Deriving Labels and Bisimilarity for Concurrent Constraint Programming

DOI10.1007/978-3-642-19805-2_10zbMath1326.68196OpenAlexW1585676371MaRDI QIDQ3000605

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

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

Mathematics Subject Classification ID

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

Related Items (6)

Belief, knowledge, lies and other utterances in an algebra for space and extrusion ⋮ Observational and behavioural equivalences for soft concurrent constraint programming ⋮ A General Theory of Barbs, Contexts, and Labels ⋮ Characterizing right inverses for spatial constraint systems with applications to modal logic ⋮ Reasoning about distributed information with infinitely many agents ⋮ Models and emerging trends of concurrent constraint programming

This page was built for publication: Deriving Labels and Bisimilarity for Concurrent Constraint Programming