Executing bigraphical reactive systems

DOI10.1016/j.dam.2018.07.006zbMath1401.05288OpenAlexW2889376928WikidataQ129330332 ScholiaQ129330332MaRDI QIDQ1634767

Ismael Bouassida Rodriguez, Amal Gassara, Mohamed Jmaiel, Khalil Drira

Publication date: 18 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.07.006

zbMATH Keywords

matchingbigraphsbigraphical reactive systems

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (2)

Computing Embeddings of Directed Bigraphs ⋮ A tale of two graph models: a case study in wireless sensor networks

Uses Software

• GMTE
• jLibBig

Cites Work

• Unnamed Item
• Unnamed Item
• Encoding bigraphical reactive systems into graph transformation systems
• An inductive characterization of matching in binding bigraphs
• Fundamentals of algebraic graph transformation
• Finding a Forest in a Tree
• The Space and Motion of Communicating Agents
• GMTE: A Tool for Graph Transformation and Exact/Inexact Graph Matching
• On Hierarchical Graphs: Reconciling Bigraphs, Gs-monoidal Theories and Gs-graphs
• Formal Methods in Software and Systems Modeling

This page was built for publication: Executing bigraphical reactive systems