Probabilistic Bigraphs
Open Access
- 30 June 2022
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 34 (2), 1-27
- https://doi.org/10.1145/3545180
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 probabilistic 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.Keywords
Funding Information
- Engineering and Physical Sciences Research Council (EP/N007565/1)
- S4: Science of Sensor Systems Software, and by PETRAS SRF (EP/S035362/1)
This publication has 26 references indexed in Scilit:
- Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharingFormal Aspects of Computing, 2014
- On the semantics of Markov automataInformation and Computation, 2013
- Probabilistic Mobile AmbientsTheoretical Computer Science, 2009
- Stochastic BigraphsElectronic Notes in Theoretical Computer Science, 2008
- Should I send now or send later? A decision-theoretic approach to transmission scheduling in sensor networks with mobile sinksWireless Communications and Mobile Computing, 2007
- Symmetry in temporal logic model checkingACM Computing Surveys, 2006
- PMaude: Rewrite-based Specification Language for Probabilistic Object SystemsElectronic Notes in Theoretical Computer Science, 2006
- The Mathematics of Infectious DiseasesSIAM Review, 2000
- Fuzzy setsInformation and Control, 1965
- Optimal control of Markov processes with incomplete state informationJournal of Mathematical Analysis and Applications, 1965