Live briefing
Everything about Bigraph
A bigraph can be modelled as the superposition of a graph and a set of trees. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: BigraphA 5-minute orientation
- Skim a recent paper: Adaptive bigraph-based multi-view unsupervised dimensionality reductionInfluential work since 2022
- Pick up a classic book: Formal Aspects of Component SoftwareThe most-reprinted book on the subject
- Read the landmark paper: System-of-systems support — A bigraph approach to interoperability and emergent behaviorCited 26 times
- Go sideways: Hennessy–Milner logicA closely related topic
- Go sideways: Configuration modelA closely related topic
đź“– Definitions
Noun bipartite graph
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
System-of-systems support — A bigraph approach to interoperability and emergent behavior
On the Line-Graph of the Complete Bigraph
A Probabilistic Approach for Guilty Agent Detection using Bigraph after Distribution of Sample Data
Longitudinal study of reading and writing rehabilitation using a bigraph–biphone correspondence approach
Heuristics, Experimental Subjects, and Treatment Evaluation in Bigraph Crossing Minimization
Batch-Wise Permutation Feature Importance Evaluation and Problem-Specific Bigraph for Learn-to-Branch
Bigraph specification of software architecture and evolution analysis in mobile computing environment
How to colour the lines of a bigraph
🆕 Influential since 2022
Adaptive bigraph-based multi-view unsupervised dimensionality reduction
BiGGer: A Model Transformation Tool written in Java for Bigraph Rewriting in GrGen.NET
BMPCN: A Bigraph Mutual Prototype Calibration Net for few-shot classification
Improving Bigraph Rewriting with GrGen.NET to Enable Efficient System Simulation
A Bigraph-Based Digital Twin for Multi-UAV Landing Management
đź“š Books worth reading
Formal Aspects of Component SoftwareFarhad Arbab · 2012
The poems of Richard Corbet, late bishop of Oxford and of NorwichRichard Corbet · 1807
Italian Lyrists of To-day: Translations from Contemporary Italian Poetry with Bigraphical NoticesGeorge Arthur Greene · 1893- 📕Memoir of Joseph Janvier Woodward, 1833-1884John S. Billings, National Academy of Sciences (U.S.) · 1885
Software ArchitectureKhalil Drira · 2013- 📕BeethovenS.E. Randolph · 1880
- 📕Who's who · 1964
- 📕Who's who · 1967
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Hennessy–Milner logic In computer science, Hennessy–Milner logic (HML) is a dynamic logic used to specify properties of a labeled transition system (LTS), a structure similar…
- Configuration model In network science, the Configuration Model is a family of random graph models designed to generate networks from a given degree sequence. Unlike simpler…
- Sparse network In network science, a sparse network has much fewer links than the possible maximum number of links within that network (the opposite is a dense network)…
- Robin Milner Arthur John Robin Gorell Milner (13 January 1934 – 20 March 2010) was a British computer scientist, and he won the 1991 ACM Turing Award. Milner was born…
- Quantum walk search In the context of quantum computing, the quantum walk search (sometimes regarded as QFS, similar to DFS and BFS) is a quantum algorithm for finding a marked…
- ZX-calculus The ZX-calculus is a graphical language. It was conceived for reasoning about linear maps between qubits, which are represented as string diagrams called…
- Graphoid A graphoid is a set of statements of the form, "X is irrelevant to Y given that we know Z" where X, Y and Z are sets of variables. The notion of "irrelevance"…
- Critical point (network science) In network science, a critical point is a value of average degree, which separates random networks that have a giant component from those that do not (i…