Reducing Weak to Strong Bisimilarity in CCP

Andrés Aristizábal
(CNRS/DGA and LIX École Polytechnique de Paris)
Filippo Bonchi
(ENS Lyon, Université de Lyon, LIP)
Luis Pino
(INRIA/DGA and LIX École Polytechnique de Paris)
Frank Valencia
(CNRS and LIX École Polytechnique de Paris)

Concurrent constraint programming (ccp) is a well-established model for concurrency that singles out the fundamental aspects of asynchronous systems whose agents (or processes) evolve by posting and querying (partial) information in a global medium. Bisimilarity is a standard behavioural equivalence in concurrency theory. However, only recently a well-behaved notion of bisimilarity for ccp, and a ccp partition refinement algorithm for deciding the strong version of this equivalence have been proposed. Weak bisimiliarity is a central behavioural equivalence in process calculi and it is obtained from the strong case by taking into account only the actions that are observable in the system. Typically, the standard partition refinement can also be used for deciding weak bisimilarity simply by using Milner's reduction from weak to strong bisimilarity; a technique referred to as saturation. In this paper we demonstrate that, because of its involved labeled transitions, the above-mentioned saturation technique does not work for ccp. We give an alternative reduction from weak ccp bisimilarity to the strong one that allows us to use the ccp partition refinement algorithm for deciding this equivalence.

In Marco Carbone, Ivan Lanese, Alexandra Silva and Ana Sokolova: Proceedings Fifth Interaction and Concurrency Experience (ICE 2012), Stockholm, Sweden, 16th June 2012, Electronic Proceedings in Theoretical Computer Science 104, pp. 2–16.
Published: 14th December 2012.

ArXived at: https://dx.doi.org/10.4204/EPTCS.104.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org