Results 11  20
of
61
On Equators in Asynchronous Namepassing Calculi without Matching (Extended Abstract)
, 1999
"... We give a labeled characterization of barbed congruence in asynchronous calculus, which, unlike previous characterizations, does not use the matching construct. In absence of matching the observer cannot directly distinguish two names. In asynchronous calculus the fact that two names are indisting ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We give a labeled characterization of barbed congruence in asynchronous calculus, which, unlike previous characterizations, does not use the matching construct. In absence of matching the observer cannot directly distinguish two names. In asynchronous calculus the fact that two names
A Bisimulation for the Blue Calculus
, 1999
"... The Blue calculus is a direct extension of both the lambda and the pi calculi. In this report, we dene an equivalence for this calculus based on barbed congruence, and we prove the validity of the replication laws. For example, we prove that a replicated resource, shared by many processes, can be sa ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
The Blue calculus is a direct extension of both the lambda and the pi calculi. In this report, we dene an equivalence for this calculus based on barbed congruence, and we prove the validity of the replication laws. For example, we prove that a replicated resource, shared by many processes, can
Reactive Systems, Barbed Semantics, and the Mobile Ambients
"... Reactive systems, proposed by Leifer and Milner, represent a metaframework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics is provided by rewriting rules. Despite its applicability, reactive systems suffered so far from two main drawbacks. Fir ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
Reactive systems, proposed by Leifer and Milner, represent a metaframework aimed at deriving behavioral congruences for those specification formalisms whose operational semantics is provided by rewriting rules. Despite its applicability, reactive systems suffered so far from two main drawbacks
A Hierarchy of Behavioral Equivalences in the pcalculus with Noisy Channels
, 2007
"... The pcalculus is a process algebra where agents interact by sending communication links to each other via noiseless communication channels. Taking into account the reality of noisy channels, an extension of the pcalculus, called the pNcalculus, has been introduced recently. This paper presents a ..."
Abstract
 Add to MetaCart
sents an early transitional semantics of the pNcalculus, which is not a directly translated version of the late semantics of pN, and then extends six kinds of behavioral equivalences consisting of reduction bisimilarity, barbed bisimilarity, barbed equivalence, barbed congruence, bisimilarity and full
2 An Asynchronous Pi Calculus (Review) 5
"... We generate a natural hierarchy of equivalences for asynchronous namepassing process calculi from simple variations on Milner and Sangiorgi’s definition of weak barbed bisimulation. The πcalculus, used here, and the join calculus are examples of such calculi. We prove that barbed congruence coinci ..."
Abstract
 Add to MetaCart
We generate a natural hierarchy of equivalences for asynchronous namepassing process calculi from simple variations on Milner and Sangiorgi’s definition of weak barbed bisimulation. The πcalculus, used here, and the join calculus are examples of such calculi. We prove that barbed congruence
Concurrent Constraints in the Fusion Calculus (Extended Abstract)
 In (Larsen et al
, 1998
"... . We use the fusion calculus, a generalization and simplification of the calculus, to model concurrent constraint programming. In particular we encode three basic variants of the aecalculus, which is a foundational calculus for the concurrent constraint programming language Oz. Using a new redu ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
reductionbased semantics and weak barbed congruences for the fusion calculus we formally establish an operational correspondence between the aecalculi and their encodings. These barbed congruences are shown to coincide with the hyperequivalences previously adopted for the fusion calculus. 1 Introduction
On the Semantics of Markov Automata
"... Abstract. Markov automata describe systems in terms of events which may be nondeterministic, may occur probabilistically, or may be subject to time delays. We define a novel notion of weak bisimulation for such systems and prove that this provides both a sound and complete proof methodology for a na ..."
Abstract

Cited by 21 (5 self)
 Add to MetaCart
natural extensional behavioural equivalence between such systems, a generalisation of reduction barbed congruence, the wellknown touchstone equivalence for a large variety of process description languages. 1
Bisimulation Proof Methods for Mobile Ambients
 IN PROC. OF ICALP’03, VOLUME 2719 OF LNCS
, 2003
"... We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. We give an LTS based operational semantics, and a labelled bisimulation based equivalence that coincides with reduction barbed congruence. We also provide two upto proof techniques that we use to prove a set of algebraic ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. We give an LTS based operational semantics, and a labelled bisimulation based equivalence that coincides with reduction barbed congruence. We also provide two upto proof techniques that we use to prove a set
Linearity, Persistence and Testing Semantics in the Asynchronous PiCalculus Abstract
, 2007
"... In [24] the authors studied the expressiveness of persistence in the asynchronous πcalculus (Aπ) wrt weak barbed congruence. The study is incomplete because it ignores the issue of divergence. In this paper, we present an expressiveness study of persistence in the asynchronous πcalculus (Aπ) wrt D ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
In [24] the authors studied the expressiveness of persistence in the asynchronous πcalculus (Aπ) wrt weak barbed congruence. The study is incomplete because it ignores the issue of divergence. In this paper, we present an expressiveness study of persistence in the asynchronous πcalculus (Aπ) wrt
Strong Bisimilarity Can Be Opened
, 2002
"... We present an extension of the semantics of the picalculus without match where strong bisimilarity in the extended semantics is a process congruence and coincides with open bisimilarity in the usual semantics. In fact, in the extended semantics, strong, late, early and open bisimilarity coincide an ..."
Abstract
 Add to MetaCart
and coincide with barbed congruence. This result leads to a simple axiom system for the finite fragment of the picalculus without match.
Results 11  20
of
61