Results 1  10
of
15,340
On the Construction of Sorted Bigraphical Reactive Systems
"... We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand. ..."
Abstract
 Add to MetaCart
We develop a theory of sorted bigraphical reactive systems. Every application of bigraphs in the literature has required an extension, a sorting, of pure bigraphs. In turn, every such application has required a redevelopment of the theory of pure bigraphical reactive systems for the sorting at hand
Bigraphical Reactive Systems: Basic Theory
 PROCEEDINGS OF THE INTERNATIONAL CONFERENCE OF MATHEMATICIANS
, 2001
"... A notion of bigraph is proposed as the basis for a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and a monograph representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which ..."
Abstract

Cited by 26 (7 self)
 Add to MetaCart
A notion of bigraph is proposed as the basis for a model of mobile interaction. A bigraph consists of two independent structures: a topograph representing locality and a monograph representing connectivity. Bigraphs are equipped with reaction rules to form bigraphical reactive systems (BRSs), which
ECEASST Deriving Barbed Bisimulations for Bigraphical Reactive Systems
"... Abstract: We study the definition of a general abstract notion of barbed bisimilarity for reactive systems on bigraphs. More precisely, given a bigraphical reactive system, we define the corresponding barbs from the contextual labels given by the IPO construction, in a general and systematic way. T ..."
Abstract
 Add to MetaCart
Abstract: We study the definition of a general abstract notion of barbed bisimilarity for reactive systems on bigraphs. More precisely, given a bigraphical reactive system, we define the corresponding barbs from the contextual labels given by the IPO construction, in a general and systematic way
Mobile Computing Seminar Bigraphical Reactive Systems
, 2004
"... The papers [1, 2] are concerned with the notion of Bigraphs. Bigraphs treat the notions of location and linking independently, which is desirable when dealing with large distributed and mobile systems, such as the Internet, where where you are does not directly affect who you can talk to. For exampl ..."
Abstract
 Add to MetaCart
transition system for bigraphical reactive systems in a manner such that the induced notion of bisimilarity is a congruence. This is obtained by requiring a → L a ′ = ⇒ L ◦ a → a ′ with L ◦ a = D ◦ r and a ′ = D ◦ R ′ for some reaction rule R → R ′. If we 1 (1) allow implication in the other direction, we
Stochastic Bigraphs
 MFPS 2008
, 2008
"... In this paper we present a stochastic semantics for Bigraphical Reactive Systems. A reduction and a labelled stochastic semantics for bigraphs are defined. As a sanity check, we prove that the two semantics are consistent with each other. We illustrate the expressiveness of the framework with an exa ..."
Abstract

Cited by 44 (13 self)
 Add to MetaCart
In this paper we present a stochastic semantics for Bigraphical Reactive Systems. A reduction and a labelled stochastic semantics for bigraphs are defined. As a sanity check, we prove that the two semantics are consistent with each other. We illustrate the expressiveness of the framework
Matching of Bigraphs
 PREPRINT OF GTVC 2006
, 2006
"... We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems. ..."
Abstract

Cited by 24 (12 self)
 Add to MetaCart
We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems.
Bigraphical Models of Contextaware Systems
, 2005
"... As part of ongoing work on evaluating Milner’s bigraphical reactive systems, we investigate bigraphical models of contextaware systems, a facet of ubiquitous computing. We find that naively encoding such systems in bigraphs is somewhat awkward; and we propose a more sophisticated modeling technique ..."
Abstract

Cited by 36 (15 self)
 Add to MetaCart
As part of ongoing work on evaluating Milner’s bigraphical reactive systems, we investigate bigraphical models of contextaware systems, a facet of ubiquitous computing. We find that naively encoding such systems in bigraphs is somewhat awkward; and we propose a more sophisticated modeling
An implementation of bigraph matching
, 2008
"... We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model of ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We describe a provably sound and complete matching algorithm for bigraphical reactive systems. The algorithm has been implemented in our BPL Tool, a first implementation of bigraphical reactive systems. We describe the tool and present a concrete example of how it can be used to simulate a model
Bigraphs and Mobile Processes (revised)
, 2004
"... A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them; it also allows bigraphs to reconfigure themselves. BRSs aim to provide a uniform way to model spatially distributed systems that both compute and comm ..."
Abstract

Cited by 66 (7 self)
 Add to MetaCart
A bigraphical reactive system (BRS) involves bigraphs, in which the nesting of nodes represents locality, independently of the edges connecting them; it also allows bigraphs to reconfigure themselves. BRSs aim to provide a uniform way to model spatially distributed systems that both compute
A Bigraph Relational Model ∗
"... In this paper, we present a model based on relations for bigraphical reactive systems [7]. Its defining characteristics are that validity and reaction relations are captured as traces in a multiset rewriting system. The relational model is derived from Milner’s graphical definition and directly ame ..."
Abstract
 Add to MetaCart
In this paper, we present a model based on relations for bigraphical reactive systems [7]. Its defining characteristics are that validity and reaction relations are captured as traces in a multiset rewriting system. The relational model is derived from Milner’s graphical definition and directly
Results 1  10
of
15,340