Practical Modelling with Bigraphs
Blair Archibald, Muffy Calder, Michele Sevegnani

TL;DR
This paper provides a comprehensive guide to developing and reasoning about bigraph models, including recent extensions like probabilistic and stochastic rewriting, to enhance their practical application in system modeling.
Contribution
It introduces detailed methodologies for implementing and extending bigraphs with new rule types and probabilistic features, advancing their practical utility.
Findings
Enhanced modeling capabilities with probabilistic and stochastic rules.
Practical guidelines for developing bigraph-based models.
Demonstrated extensions improve expressiveness and flexibility.
Abstract
Bigraphs are a versatile modelling formalism that allows easy expression of placement and connectivity relations in a graphical format. System evolution is user defined as a set of rewrite rules. This paper presents a practical, yet detailed guide to developing, executing, and reasoning about bigraph models, including recent extensions such as parameterised, instantaneous, prioritised and conditional rules, and probabilistic and stochastic rewriting.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsModel-Driven Software Engineering Techniques · Graph Theory and Algorithms
