Barbed bisimulation

Milner, Robin; Sangiorgi, Davide

doi:10.1007/3-540-55719-9_114

Cited by 337 publications

(286 citation statements)

References 3 publications

Supporting

Mentioning

286

Contrasting

Order By: Relevance

“…Previous solutions have been to either require that two processes are related if and only if they are bisimilar under all possible contexts (see [17]) or to derive a labelled transition system manually. Since the first solution needs quantification over all possible contexts, proofs of bisimilarity can be very complicated.…”

Section: Introductionmentioning

confidence: 99%

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting

Ehrig

König

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the DPO (double-pushout) approach to graph rewriting. Unlike in previous approaches, we consider graphs as objects, instead of arrows, of the category under consideration. This allows us to present a very simple way of deriving labelled transitions (called rewriting steps with borrowed context) which smoothly integrates with the DPO approach, has a very constructive nature and requires only a minimum of category theory. The core part of this paper is the proof sketch that the bisimilarity based on rewriting with borrowed contexts is a congruence relation.

show abstract

Section: Introductionmentioning

confidence: 99%

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting

Ehrig

König

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Hence, input actions cannot be observed by an external observer and only output actions are observable in AbC . By following Milner and Sangiorgi [20], we use the term "barb" as synonymous with observable. In what follows, we shall use the following notations:…”

Section: Reduction Barbed Congruencementioning

confidence: 99%

On the Power of Attribute-Based Communication

Alrahman

Nicola

Loreti

2016

Formal Techniques for Distributed Objects, Components, and Systems

View full text Add to dashboard Cite

Abstract. In open systems, i.e. systems operating in an environment that they cannot control and with components that may join or leave, behaviors can arise as side effects of intensive components interaction. Finding ways to understand and design these systems and, most of all, to model the interactions of their components, is a difficult but important endeavor. To tackle these issues, we present AbC , a calculus for attributebased communication. An AbC system consists of a set of parallel agents each of which is equipped with a set of attributes. Communication takes place in an implicit multicast fashion, and interactions among agents are dynamically established by taking into account "connections" as determined by predicates over the attributes of agents. First, the syntax and the semantics of the calculus are presented, then expressiveness and effectiveness of AbC are demonstrated both in terms of modeling scenarios featuring collaboration, reconfiguration, and adaptation and of the possibility of encoding channel-based interactions and other interaction patterns. Behavioral equivalences for AbC are introduced for establishing formal relationships between different descriptions of the same system.

show abstract

“…Barbed equivalences have been introduced in [21] for CCS, and have become the standard behavioural equivalences for formalisms equipped with unlabeled reduction semantics. Intuitively, barbs are basic observations (predicates) on the states of a system.…”

Section: Saturated Barbed Bisimilaritymentioning

confidence: 99%

Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Aristizábal

Bonchi

Palamidessi

et al. 2011

Foundations of Software Science and Computational Structures

View full text Add to dashboard Cite

Abstract. Concurrent constraint programming (ccp) is a well-established model for concurrency. Bisimilarity is one of the central reasoning techniques in concurrency. The standard definition of bisimilarity, however, is not completely satisfactory for ccp since it yields an equivalence that is too fine grained. By building upon recent foundational investigations, we introduce a labelled transition semantics and a novel notion of bisimilarity that is fully abstract w.r.t. the typical observational equivalence in ccp.

show abstract

Barbed bisimulation

Cited by 337 publications

References 3 publications

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting

Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting

On the Power of Attribute-Based Communication

Deriving Labels and Bisimilarity for Concurrent Constraint Programming

Contact Info

Product

Resources

About