Bigraphs with sharing

DOI10.1016/j.tcs.2015.02.011zbMath1309.68156OpenAlexW2158422857WikidataQ59675298 ScholiaQ59675298MaRDI QIDQ2339468

Michele Sevegnani, Muffy Calder

Publication date: 1 April 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.011

zbMATH Keywords

matchingrewritingsemanticsspatial modelsbigraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

Conditional Bigraphs ⋮ Computing Embeddings of Directed Bigraphs ⋮ The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants ⋮ A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs ⋮ A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity ⋮ (WEAK) INCIDENCE BIALGEBRAS OF MONOIDAL CATEGORIES ⋮ Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing ⋮ A tale of two graph models: a case study in wireless sensor networks

Uses Software

• MiniSat
• PRISM
• Graphviz
• Dbtk

Cites Work

• Unnamed Item
• Unnamed Item
• Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing
• Matching of Bigraphs
• A Coalgebraic Theory of Reactive Systems
• DBtk: A Toolkit for Directed Bigraphs
• The Space and Motion of Communicating Agents
• An Algorithm for Subgraph Isomorphism
• Faster Subtree Isomorphism
• Directed Bigraphs
• Stochastic Bigraphs
• Automata, Languages and Programming

This page was built for publication: Bigraphs with sharing