Abstract: Bigraphs are a universal computational modelling formalism for the spatial and temporal evolution of a system in which entities can be added and removed. We extend bigraphs to probablistic bigraphs, and then again to action bigraphs, which include non-determinism and rewards. The extensions are implemented in the BigraphER toolkit and illustrated through examples of virus spread in computer networks and data harvesting in wireless sensor systems. BigraphER also supports the existing stochastic bigraphs extension of Krivine et al., and using BigraphER we give, for the first time, a direct implementation of the membrane budding model used to motivate stochastic bigraphs.
Recommendations
Cited in
(8)- \textsf{DBtk}: a toolkit for directed bigraphs
- Stochastic bigraphs
- RNA: R1CS normalization algorithm based on data flow graphs for zero-knowledge proofs
- Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing
- scientific article; zbMATH DE number 1245629 (Why is no real title available?)
- Probabilistic construction of proportional graphs
- Modelling real-time systems with bigraphs
- Probabilistic pursuits on graphs
This page was built for publication: Probabilistic Bigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136750)
