Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
38
Axioms For Bigraphical Structure
- UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2005
"... This paper axiomatises the structure of bigraphs, and proves that the resulting theory is complete. Bigraphs are graphs with double structure, representing locality and connectivity. They have been shown to represent dynamic theories for the #-calculus, mobile ambients and Petri nets, in a way th ..."
Abstract
-
Cited by 41 (8 self)
- Add to MetaCart
This paper axiomatises the structure of bigraphs, and proves that the resulting theory is complete. Bigraphs are graphs with double structure, representing locality and connectivity. They have been shown to represent dynamic theories for the #-calculus, mobile ambients and Petri nets, in a way
Pure bigraphs: structure and dynamics
, 2005
"... Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigraphical reactive system (Brs) in which bigraphs can reconfigure themselves. Following an earlier paper describing link graphs, a c ..."
Abstract
-
Cited by 62 (5 self)
- Add to MetaCart
Bigraphs are graphs whose nodes may be nested, representing locality, independently of the edges connecting them. They may be equipped with reaction rules, forming a bigraphical reactive system (Brs) in which bigraphs can reconfigure themselves. Following an earlier paper describing link graphs, a
Spatial Logics for Bigraphs
- In Proceedings of ICALP’05, volume 3580 of LNCS
, 2005
"... Abstract. Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, pi-calculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. With the aim of describing bigraphical structur ..."
Abstract
-
Cited by 27 (3 self)
- Add to MetaCart
Abstract. Bigraphs are emerging as an interesting model for concurrent calculi, like CCS, pi-calculus, and Petri nets. Bigraphs are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. With the aim of describing bigraphical
Edinburgh Research Explorer
, 2004
"... Axioms for bigraphical structure Citation for published version: ..."
Edinburgh Research Explorer
"... Pure bigraphs: Structure and dynamics Citation for published version: ..."
The Bigraphical Lasso
"... The i.i.d. assumption in machine learning is endemic, but often flawed. Complex data sets exhibit partial correlations between both instances and features. A model specifying both types of correlation can have a number of parameters that scales quadratically with the number of features and data poin ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
points. We introduce the bigraphical lasso, an estimator for precision matrices of matrix-normals based on the Cartesian product of graphs. A prominent product in spectral graph theory, this structure has appealing properties for regression, enhanced sparsity and interpretability. To deal
Developing Bigraphical Languages
"... In this dissertation, we study bigraphical languages—languages based on the theory for bigraphs and bigraphical reactive systems developed by Milner and coworkers. We begin by examining algebraic theory for binding bigraphs. We give a term language for binding bigraphs and develop a complete axiomat ..."
Abstract
- Add to MetaCart
axiomatization of structural equivalence. Along the way, we develop a set of normal form theorems, which prove convenient for the analysis of bigraphical structure. We examine next the central problem of matching, that is, to determine when and where the left-hand side of a bigraphical reaction rule matches a
BiLog: Spatial Logics for Bigraphs
, 2005
"... Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. Aiming at describing bigraphical structures, we introduce a ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Bigraphs are emerging as a (meta-)model for concurrent calculi, like CCS, ambients, πcalculus, and Petri nets. They are built orthogonally on two structures: a hierarchical place graph for locations and a link (hyper-)graph for connections. Aiming at describing bigraphical structures, we introduce
Bigraphical Logics for XML
, 2005
"... Bigraphs are emerging as an interesting model that can represent both the picalculus and the ambient calculus. Bigraphs are built orthogonally on two structures: a hierarchical `place' graph for locations and a `link' (hyper-)graph for connections. ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
Bigraphs are emerging as an interesting model that can represent both the picalculus and the ambient calculus. Bigraphs are built orthogonally on two structures: a hierarchical `place' graph for locations and a `link' (hyper-)graph for connections.
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 (term-based) tool for bigraphical reactive systems. I present two main results (developed with co-authors). 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 (term-based) tool for bigraphical reactive systems. I present two main results (developed with co-authors). First, I give an axiomatization of structural congruence
Results 1 - 10
of
38
