Results 1 - 10 of 143

The Fusion Calculus

by Ernesto Posse
"... 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

by Vishal Grover, Ashin P. Thariyan , 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

by Ivan Lanese, Ugo Montanari , 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

by Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto, Kidane Yemane
"... Abstract. We present a partition refinement algorithm for the Fusion calculus. The algorithm is based on HD-automata and exploits a coalgebraic functor representing a symbolic semantics of the Fusion calculus. HD-automata have have successfully been applied for monadic versions of ss-calculus and ha ..."
Abstract - Add to MetaCart
Abstract. We present a partition refinement algorithm for the Fusion calculus. The algorithm is based on HD-automata and exploits a coalgebraic functor representing a symbolic semantics of the Fusion calculus. HD-automata have have successfully been applied for monadic versions of ss-calculus

Strong Bisimulation for the Explicit Fusion Calculus

by Lucian Wischik, Philippa Gardner , 2004
"... The pi calculus holds the promise of compile-time 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 well-known 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 HD-Automata

by Gianluigi Ferrari, Ugo Montanari, Emilio Tuosto, Kidane Yemane - in CALCO, ser. LNCS , 2005
"... Abstract. We propose a coalgebraic model of the Fusion calculus based on HD-automata. The main advantage of the approach is that the par-tition refinement algorithm designed for HD-automata 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 HD-automata. The main advantage of the approach is that the par-tition refinement algorithm designed for HD-automata is easily adapted to handle Fusion calculus processes. Hence, the transition systems of Fusion calculus

Polyadic History-Dependent Automata for the Fusion Calculus

by Emilio Tuosto, Björn Victor, Kidane Yemane , 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 History-Dependent Automatafor the Fusion Calculus

by Emilio Tuosto, Kidane Yemane
"... 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)

by Björn Victor, Joachim Parrow - 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 ae-calculus, 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 ae-calculus, which is a foundational calculus for the concurrent constraint programming language Oz. Using a new

D-fusion: a distinctive fusion calculus

by Michele Boreale, Maria Grazia Buscemi, Ugo Montanari - 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 pi-calculus into Fusion. This fact motivates the introduction of a new calculus, D-Fusion, with two binders, λ and ν. We show that D-Fusion 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 pi-calculus into Fusion. This fact motivates the introduction of a new calculus, D-Fusion, with two binders, λ and ν. We show that D-Fusion
Results 1 - 10 of 143