Probabilistic Bigraphs

DOI10.1145/3545180zbMATH Open1522.68252arXiv2105.02559OpenAlexW4283514101MaRDI QIDQ6136750FDOQ6136750

Blair Archibald, Michele Sevegnani, M. Calder

Publication date: 31 August 2023

Published in: Formal Aspects of Computing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2105.02559

Recommendations

• Stochastic bigraphs
• Pure bigraphs: structure and dynamics
• scientific article; zbMATH DE number 1863157
• Conditional bigraphs
• Bigraphs with sharing

zbMATH Keywords

systems modellingprobabilistic modellingbigraphsgraph rewriting

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Grammars and rewriting systems (68Q42)

Cited In (3)

• Title not available (Why is that?)
• Probabilistic construction of proportional graphs
• 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)