Results 1  10
of
29
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 20 (11 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.
Typed polyadic picalculus in bigraphs
 Proceedings of the 8th International Symposium on Principles and Practice of Declarative Programming (PPDP'06)
, 2006
"... Bigraphs have been introduced with the aim to provide a topographical metamodel for mobile, distributed agents that can manipulate their own communication links and nested locations. In this paper we examine a presentation of type systems on bigraphical systems using the notion of sorting. We focus ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
Bigraphs have been introduced with the aim to provide a topographical metamodel for mobile, distributed agents that can manipulate their own communication links and nested locations. In this paper we examine a presentation of type systems on bigraphical systems using the notion of sorting. We focus our attention on the typed polyadic πcalculus with capability types à la Pierce and Sangiorgi, which we represent using a novel kind of link sorting called subsorting. Using the theory of relative pushouts we derive a labelled transition system which yield a coinductive characterisation of a behavioural congruence for the calculus. The results obtained in this paper constitute a promising foundation for the presentation of various type systems for the (polyadic) πcalculus as sortings in the setting of bigraphs.
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 8 (4 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.
Axiomatizing Binding Bigraphs
 NORDIC JOURNAL OF COMPUTING
, 2006
"... We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms. Our work builds on Milner’s axioms for pure bigraphs. We have extended the ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We axiomatize the congruence relation for binding bigraphs and prove that the generated theory is complete. In doing so, we define a normal form for binding bigraphs, and prove that it is unique up to certain isomorphisms. Our work builds on Milner’s axioms for pure bigraphs. We have extended the set of axioms with five new axioms concerned with binding, and we have altered some of Milner’s axioms for ions, because ions in binding bigraphs have names on both their inner and outer faces. The resulting theory is a conservative extension of Milner’s for pure bigraphs.
M.: Bigraphs with sharing
, 2010
"... Abstract. Bigraphical reactive systems (BRSs) [1] are a fully graphical model for mobile computation in which both time and space are prominent. But the locality is a tree structure, space can not be shared. We extend the formalism to BRS with sharing, which models the system topology by a directed ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Abstract. Bigraphical reactive systems (BRSs) [1] are a fully graphical model for mobile computation in which both time and space are prominent. But the locality is a tree structure, space can not be shared. We extend the formalism to BRS with sharing, which models the system topology by a directed graph structure. We present a categorical characterisation of bigraphs with sharing and a complete axiomatisation for algebraic expressions of bigraphs with sharing. 1
Incremental awareness and compositionality: a design philosophy for contextaware pervasive systems, Pervasive and Mobile Computing 6 (2
, 2010
"... Contextaware pervasive systems are an important emerging category of software, increasingly pervading into daily life, play and work. These systems are characterized by capabilities for sensing the physical world and taking action, autonomously or in cooperation with users. This paper proposes an ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Contextaware pervasive systems are an important emerging category of software, increasingly pervading into daily life, play and work. These systems are characterized by capabilities for sensing the physical world and taking action, autonomously or in cooperation with users. This paper proposes an incremental approach to building contextaware pervasive systems, with a particular emphasis on systematically extending over time the contexts and situations a system can be aware of, and creating a formalism in which these systems can be composed. We present a formalism of operators for building contextaware pervasive systems incrementally and in a compositional manner (by combining multiple systems and subsystems), facilitating reuse in a formal way. The formalism can serve as (i) a basis for a scripting language for programming composite systems, and (ii) a language for specifying these systems (whether existing or to be built) and then reasoning with specifications of these systems. 1
Syntactic theory for bigraphs
, 2006
"... I investigate and develop theory for term languages for a variant of bigraphs with binding, thus building the formal foundation for a (termbased) tool for bigraphical reactive systems. I present two main results (developed with coauthors). First, I give an axiomatization of structural congruence ( ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
I investigate and develop theory for term languages for a variant of bigraphs with binding, thus building the formal foundation for a (termbased) tool for bigraphical reactive systems. I present two main results (developed with coauthors). First, I give an axiomatization of structural congruence (graph equivalence) for binding bigraphs. Along the way, I devise a term language for binding bigraphs and prove a series of normal form theorems for binding bigraphs. Second, using these results, I give a complete inductive characterization of matching in bigraphs — essentially, for describing when and where a bigraphical reaction rule can be applied. I include an introduction to the goals of my Ph.D. project and explain how it relates to the goals of the BPL project. Moreover, I outline a number of future challenges and include a litterature study for future work.