A behavioral congruence for concurrent constraint programming with nondeterministic choice

DOI10.1007/978-3-319-10882-7_21MaRDI QIDQ2938173zbMATH OpenOpenAlexFDO

Authors Luis F. Pino, Filippo Bonchi, Frank D. Valencia

Publication date 13 January 2015

Published in Theoretical Aspects of Computing – ICTAC 2014 (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-01006382v2/file/ictac14-final.pdf

Mathematics Subject Classification ID

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

Recommendations

• Deriving labels and bisimilarity for concurrent constraint programming
• Reducing weak to strong bisimilarity in CCP
• Confluence in concurrent constraint programming
• Truly concurrent constraint programming
• Bisimilarity in concurrent constraint programming

Cited in

(4)

• Observational and behavioural equivalences for soft concurrent constraint programming
• Deriving labels and bisimilarity for concurrent constraint programming
• scientific article; zbMATH DE number 92600 (Why is no real title available?)
• Reducing weak to strong bisimilarity in CCP

This page was built for publication: A behavioral congruence for concurrent constraint programming with nondeterministic choice

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