Weak CCP bisimilarity with strong procedures

•We show that the standard saturation method for reducing weak bisimilarity to strong bisimilarity does not work for CCP.•We provide a new saturation method for reducing weak bisimilarity to strong bisimilarity for CCP.•We prove that due to distinctive nature of CCP, the new method does not introduc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Science of computer programming Jg. 100; S. 84 - 104
Hauptverfasser: Pino, Luis F., Aristizábal, Andrés, Bonchi, Filippo, Valencia, Frank
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 15.03.2015
Elsevier
Schlagworte:
Computer Science
Concurrent constraint programming
Formal Languages and Automata Theory
Logic in Computer Science
Partition refinement
Weak bisimilarity
Concurrent constraint programming
Weak bisimilarity
Partition refinement
Bisimulation
Concurrency Theory
ISSN:0167-6423, 1872-7964
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:•We show that the standard saturation method for reducing weak bisimilarity to strong bisimilarity does not work for CCP.•We provide a new saturation method for reducing weak bisimilarity to strong bisimilarity for CCP.•We prove that due to distinctive nature of CCP, the new method does not introduce infinitely-branching in the resulting transition systems.•We then derive an algorithm to automatically verify the notion of weak bisimilarity in CCP. 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.
ISSN:0167-6423
1872-7964
DOI:10.1016/j.scico.2014.09.007