Skip to Main content Skip to Navigation
Journal articles

Weak CCP bisimilarity with strong procedures

Abstract : 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 behavioral 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 bisimilarity is a central behavioral 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.
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download
Contributor : Luis Fernando Pino Duque Connect in order to contact the contributor
Submitted on : Saturday, December 27, 2014 - 8:20:49 PM
Last modification on : Thursday, January 20, 2022 - 5:28:39 PM
Long-term archiving on: : Monday, March 30, 2015 - 4:06:10 PM


Files produced by the author(s)



Luis Pino, Andres Aristizabal, Filippo Bonchi, Frank Valencia. Weak CCP bisimilarity with strong procedures. Science of Computer Programming, Elsevier, 2015, 100, pp.84-104. ⟨10.1016/j.scico.2014.09.007⟩. ⟨hal-00976768v2⟩



Record views


Files downloads