Probabilistic bigraphs

Archibald, B. , Calder, M. and Sevegnani, M. (2022) Probabilistic bigraphs. Formal Aspects of Computing, 34(2), 10. (doi: 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.

• Item Type: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Calder, Professor Muffy and Sevegnani, Dr Michele and Archibald, Dr Blair
• Authors: Archibald, B., Calder, M., and Sevegnani, M.
• College/School: College of Science and Engineering > School of Computing Science
• Journal Name: Formal Aspects of Computing
• Publisher: ACM Press
• ISSN: 0934-5043
• ISSN (Online): 1433-299X
• Published Online: 25 June 2022
• Copyright Holders: Copyright © 2022 The Authors
• First Published: First published in Formal Aspects of Computing 34(2): 10
• Publisher Policy: Reproduced under a Creative Commons License

Project Code	Award No	Project Name	Principal Investigator	Funder's Name	Funder Ref	Lead Dept
172422		Science of Sensor System Software (SSSS)	Muffy Calder	Engineering and Physical Sciences Research Council (EPSRC)	EP/N007565/1	Computing Science