Searching for "Axiomatizing Binding Bigraphs." – sorted by Relevance.
-
Syntactic theory for bigraphs
- -authors). First, I give an axiomatization of structural congruence (graph equivalence) for binding bigraphs. Along
- Cited by 2 (1 self) – Add To MetaCart
-
Developing Bigraphical Languages
- .1.1 Axiomatizing Binding Bigraphs . . . . . . . . . . . . . . . . . 17 2.1.2 An Inductive Characterization
- Add To MetaCart
-
Formalizing higher-order mobile embedded business processes with binding bigraphs
- bigraphs also admit a representation via a term language based on the axiomatization of binding bigraphs [7
- Cited by 2 (1 self) – Add To MetaCart
-
in the Bigraphical Programming Languages (BPL) Tool ∗
- . However, binding bigraphs also admit a representation via a term language based on the axiomatization
- Add To MetaCart

