A tale of two graph models: a case study in wireless sensor networks
From MaRDI portal
Publication:2065559
DOI10.1007/s00165-021-00558-zOpenAlexW3183517265MaRDI QIDQ2065559
Michele Sevegnani, Géza Kulcsár, Blair Archibald
Publication date: 11 January 2022
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: http://eprints.gla.ac.uk/247006/1/247006.pdf
wireless sensor networksgraph transformation systemsbigraphical reactive systemsrewriting-based modelling
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Modelling IEEE 802.11 CSMA/CA RTS/CTS with stochastic bigraphs with sharing
- An operational semantics for a calculus for wireless systems
- Term-rewriting systems with rule priorities
- Executing bigraphical reactive systems
- Graph surfing by reaction systems
- Graph-rewriting Petri nets
- Equivalence and independence in controlled graph-rewriting processes
- A tutorial on graph transformation
- Probabilistic timed graph transformation systems
- Bigraphs with sharing
- Drags: a compositional algebraic framework for graph rewriting
- Fundamentals of algebraic graph transformation
- A Process Algebra for Wireless Mesh Networks
- Probabilistic Graph Transformation Systems
- Inductive Invariant Checking with Partial Negative Application Conditions
- The Space and Motion of Communicating Agents
- Handbook of Graph Grammars and Computing by Graph Transformation
- Granularity of Conflicts and Dependencies in Graph Transformation Systems
- Conditional Bigraphs
- On the Decidability Status of Reachability and Coverability in Graph Transformation Systems
- Stochastic Bigraphs
