Results 1  10
of
24
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 with an example of membrane budding in a biological system.
On the Construction of Sorted Reactive Systems
 IN PROCEEDINGS OF CONCUR’08, LNCS
, 2008
"... 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

Cited by 10 (5 self)
 Add to MetaCart
(Show Context)
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. Here we present a general construction of sortings. The constructed sortings always sustain the behavioural theory of pure bigraphs (in a precise sense), thus obviating the need to redevelop that theory for each new application. As an example, we recover Milner’s local bigraphs as a sorting on pure bigraphs. Technically, we give our construction for ordinary reactive systems, then lift it to bigraphical reactive systems. As such, we give also a construction of sortings for ordinary reactive systems. This construction is an improvement over previous attempts in that it produces smaller and much more natural sortings, as witnessed by our recovery of local bigraphs as a sorting.
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
(Show Context)
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 a mobile phone system in a bigraphical representation of the polyadic π calculus.
Variable binding, symmetric monoidal closed theories, and bigraphs
 In Bravetti and Zavattaro [2
"... bigraphs ..."
(Show Context)
M (2010) Bigraphs with sharing
"... Bigraphical Reactive Systems (BRS) were designed by Milner as a universal formalism for modelling systems that evolve in time, locality, colocality and connectivity. But the underlying model of location (the place graph) is a forest, which means there is no straightforward representation of locati ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Bigraphical Reactive Systems (BRS) were designed by Milner as a universal formalism for modelling systems that evolve in time, locality, colocality and connectivity. But the underlying model of location (the place graph) is a forest, which means there is no straightforward representation of locations that can overlap or intersect. This occurs in many domains, for example in wireless signalling, social interactions and audio communications. Here, we define bigraphs with sharing, which solves this problem by an extension of the basic formalism: we define the place graph as a directed acyclic graph, thus allowing a natural representation of overlapping or intersecting locations. We give a complete presentation of the theory of bigraphs with sharing, including a categorical semantics, algebraic properties, and several essential procedures for computation: bigraph with sharing matching, a SAT encoding of matching, and checking a fragment of the logic BiLog. We show that matching is an instance of the NPcomplete subgraph isomorphism problem and our approach based on a SAT encoding is also efficient for standard bigraphs. We give an overview of BigraphER (Bigraph Evaluator & Rewriting), an efficient implementation of bigraphs with sharing that provides manipulation, simulation and visualisation. The matching engine is based on the SAT encoding of the matching algorithm. Examples from the 802.11 CSMA/CA RTS/CTS protocol and a network management support system illustrate the applicability of the new theory.
M.: Dbtk: A toolkit for directed bigraphs
, 2009
"... Abstract. We present DBtk, a toolkit for Directed Bigraphs. DBtk supports a textual language for directed bigraphs, the graphical visualization of bigraphs, the calculation of IPO labels, and the calculation of redex matchings. Therefore, this toolkit provides the main functions needed to implement ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We present DBtk, a toolkit for Directed Bigraphs. DBtk supports a textual language for directed bigraphs, the graphical visualization of bigraphs, the calculation of IPO labels, and the calculation of redex matchings. Therefore, this toolkit provides the main functions needed to implement simulators and verification tools. 1
Computation in the Informatic Jungle
, 2010
"... Informatics bridges Turingcomputation and interactive behaviour; examples of the latter include ubiquitous/pervasive and biological systems. But how does a model of computation fit within a model of less disciplined informatic behaviour? This paper offers a precise treatment of that relationship, i ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Informatics bridges Turingcomputation and interactive behaviour; examples of the latter include ubiquitous/pervasive and biological systems. But how does a model of computation fit within a model of less disciplined informatic behaviour? This paper offers a precise treatment of that relationship, identifying a class of calculational bigraphical reactive systems. We show how such a system contain a confluent calculation submodel, and how calculation only ever enables, never prevents, informatic behaviour of the larger model. We submit these results as a modest but essential beginning of a unified informatic theory.