Results 1  10
of
143
The Fusion Calculus
"... Introduction The Fusion Calculus is a foundational calculus for concurrency, particularly a calculus for mobile processes. It is introduced as a "[...] significant step towards a canonical calculus of concurrency". [V98] In the framework of concurrent systems we refer to mobility as the ..."
Abstract
 Add to MetaCart
Introduction The Fusion Calculus is a foundational calculus for concurrency, particularly a calculus for mobile processes. It is introduced as a "[...] significant step towards a canonical calculus of concurrency". [V98] In the framework of concurrent systems we refer to mobility
Conformance Relation for Fusion Calculus
, 2002
"... In this thesis we present a formulation of the conformance relation for the fusion calculus. As described in [?], conformace is a precongruence relation for concurrent systems. We extend the notion of conformance as a re nement relation to the Fusion Calculus[?]. A complete axiomatisation for confor ..."
Abstract
 Add to MetaCart
In this thesis we present a formulation of the conformance relation for the fusion calculus. As described in [?], conformace is a precongruence relation for concurrent systems. We extend the notion of conformance as a re nement relation to the Fusion Calculus[?]. A complete axiomatisation
A Graphical Fusion Calculus
, 2004
"... We analyze the relationship between Fusion Calculus and graph transformations defined in the Synchronized Hyperedge Replacement (SHR) style. In particular we show that the underlying algebraic structure is the same when the synchronization used in SHR is Milner synchronization. The main difference w ..."
Abstract

Cited by 11 (8 self)
 Add to MetaCart
We analyze the relationship between Fusion Calculus and graph transformations defined in the Synchronized Hyperedge Replacement (SHR) style. In particular we show that the underlying algebraic structure is the same when the synchronization used in SHR is Milner synchronization. The main difference
Modelling and Minimising the Fusion calculus
"... Abstract. We present a partition refinement algorithm for the Fusion calculus. The algorithm is based on HDautomata and exploits a coalgebraic functor representing a symbolic semantics of the Fusion calculus. HDautomata have have successfully been applied for monadic versions of sscalculus and ha ..."
Abstract
 Add to MetaCart
Abstract. We present a partition refinement algorithm for the Fusion calculus. The algorithm is based on HDautomata and exploits a coalgebraic functor representing a symbolic semantics of the Fusion calculus. HDautomata have have successfully been applied for monadic versions of sscalculus
Strong Bisimulation for the Explicit Fusion Calculus
, 2004
"... The pi calculus holds the promise of compiletime checks for whether a given program will have the correct interactive behaviour. The theory behind such checks is called bisimulation. In the synchronous pi calculus, it is wellknown that the various natural definitions of (strong) bisimulation y ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
yield di#erent relations. In contrast, for the asynchronous pi calculus, they collapse to a single relation. We show that the definitions transfer naturally from the pi calculus to the explicit fusion calculus (a symmetric variant of the synchronous pi calculus), where they also collapse and yield a
Modelling Fusion Calculus using HDAutomata
 in CALCO, ser. LNCS
, 2005
"... Abstract. We propose a coalgebraic model of the Fusion calculus based on HDautomata. The main advantage of the approach is that the partition refinement algorithm designed for HDautomata is easily adapted to handle Fusion calculus processes. Hence, the transition systems of Fusion calculus proces ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. We propose a coalgebraic model of the Fusion calculus based on HDautomata. The main advantage of the approach is that the partition refinement algorithm designed for HDautomata is easily adapted to handle Fusion calculus processes. Hence, the transition systems of Fusion calculus
Polyadic HistoryDependent Automata for the Fusion Calculus
, 2003
"... Abstract. We extend History Dependent Automata to handle polyadic labels, and using a new symbolic semantics of fusion calculus we give a mapping into these Polyadic HDA with Negative Transitions, and show that the mapping is adequate with respect to hyperequivalence in the fusion calculus. This lay ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. We extend History Dependent Automata to handle polyadic labels, and using a new symbolic semantics of fusion calculus we give a mapping into these Polyadic HDA with Negative Transitions, and show that the mapping is adequate with respect to hyperequivalence in the fusion calculus
Polyadic HistoryDependent Automatafor the Fusion Calculus
"... Abstract. We extend History Dependent Automata to handle polyadic labels, and using a new symbolicsemantics of fusion calculus we give a mapping into these Polyadic HDA with Negative Transitions, and show that the mapping is adequate with respect to hyperequivalence in the fusion calculus.This lays ..."
Abstract
 Add to MetaCart
Abstract. We extend History Dependent Automata to handle polyadic labels, and using a new symbolicsemantics of fusion calculus we give a mapping into these Polyadic HDA with Negative Transitions, and show that the mapping is adequate with respect to hyperequivalence in the fusion calculus.This lays
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
. 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
Dfusion: a distinctive fusion calculus
 In Proc. of APLAS04, volume 3302 of LNCS
, 2004
"... Abstract. Fusion calculus is commonly regarded as a generalisation of picalculus. Actually, we prove that there is no uniform fully abstract embedding of picalculus into Fusion. This fact motivates the introduction of a new calculus, DFusion, with two binders, λ and ν. We show that DFusion is str ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
Abstract. Fusion calculus is commonly regarded as a generalisation of picalculus. Actually, we prove that there is no uniform fully abstract embedding of picalculus into Fusion. This fact motivates the introduction of a new calculus, DFusion, with two binders, λ and ν. We show that DFusion
Results 1  10
of
143