Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
DOI10.1007/978-3-540-78800-3_3zbMATH Open1134.68418OpenAlexW1650107222MaRDI QIDQ5458318FDOQ5458318
Bengt Jonsson, Oskar Wibling, Mayank Saksena
Publication date: 11 April 2008
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78800-3_3
Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Network protocols (68M12)
Cites Work
- Title not available (Why is that?)
- Algorithmic analysis of programs with well quasi-ordered domains.
- Verifying programs with unreliable channels
- Formal verification of standards for distance vector routing protocols
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
- Tools and Algorithms for the Construction and Analysis of Systems
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems)
- Static Analysis of Dynamic Communication Systems by Partner Abstraction
Cited In (10)
- The Edge of Graph Transformation — Graphs for Behavioural Specification
- Sound and Complete Abstract Graph Transformation
- On the Verification of Timed Ad Hoc Networks
- Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
- Automatic Verification of Directory-Based Consistency Protocols
- Well-structured graph transformation systems
- Liveness in broadcast networks
- Parameterized verification of time-sensitive models of ad hoc network protocols
- Modeling and efficient verification of wireless ad hoc networks
- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
Uses Software
This page was built for publication: Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458318)
