The design and analysis of algorithms
The design and analysis of algorithms
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Network routing with path vector protocols: theory and applications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Describing data flow analysis techniques with Kleene algebra
Science of Computer Programming
Automated Reasoning in Kleene Algebra
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A process calculus for Mobile Ad Hoc Networks
Science of Computer Programming
Increasing bisemigroups and algebraic routing
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Using probabilistic kleene algebra for protocol verification
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
| Hi-index | 0.00 |
We use well-known algebraic concepts like semirings and matrices to model and argue about Wireless Mesh Networks. These networks are used in a wide range of application areas, including public safety and transportation. Formal reasoning therefore seems to be necessary to guarantee safety and security. In this paper, we model a simplified algebraic version of the AODV protocol and provide some basic properties. For example we show that each node knows a route to the originator of a message (if there is one).