J. Ahrenholz, C. Danilov, T. Henderson & J. Kim (2008):
CORE: A Real-Time Network Emulator,
doi:10.1109/MILCOM.2008.4753614.
G. Behrmann, A. David & K. G. Larsen (2004):
A Tutorial on Uppaal.
In: Marco Bernardo & Flavio Corradini: Formal Methods for the Design of Real-Time Systems,
Lecture Notes in Computer Science 3185.
Springer,
pp. 200–236,
doi:10.1007/978-3-540-30080-9_7.
R. Bellman (1958):
On a Routing Problem.
Quarterly of Applied Mathematics 16,
pp. 87–90,
doi:10.1090/qam/102435.
J. A. Bergstra & J. W. Klop (1986):
Algebra of Communicating Processes.
In: J. W. de Bakker, M. Hazewinkel & J. K. Lenstra: Mathematics and Computer Science,
CWI Monograph 1.
North-Holland,
pp. 89–138.
J. Borgström, S. Huang, M. Johansson, P. Raabjerg, B. Victor, J. Å Pohjola & J. Parrow (2011):
Broadcast Psi-calculi with an Application to Wireless Protocols.
In: G. Barthe, A. Pardo & G. Schneider: Software Engineering and Formal Methods (SEFM'11),
Lecture Notes in Computer Science 7041.
Springer,
pp. 74–89,
doi:10.1007/978-3-642-24690-6_7.
E. Bres, R. van Glabbeek & P. Höfner (2016):
A Timed Process Algebra for Wireless Networks with an Application in Routing (Extended Abstract).
In: P. Thiemann: Programming Languages and Systems (ESOP'16),
Lecture Notes in Computer Science 9632.
Springer,
pp. 95–122,
doi:10.1007/978-3-662-49498-1_5.
E. Bres, R. van Glabbeek & R. Höfner (2016):
A Timed Process Algebra for Wireless Networks.
CoRR abs/1606.03663.
Available at http://arxiv.org/abs/1606.03663.
E. Clarke, D. Kroening & F. Lerda (2004):
A Tool for Checking ANSI-C Programs.
In: K. Jensen & A. Podelski: Tools and Algorithms for the Construction and Analysis of Systems (TACAS'04),
Lecture Notes in Computer Science 2988.
Springer,
pp. 168–176,
doi:10.1007/978-3-540-24730-2_15.
R. Coltun, D. Ferguson, J. Moj & A. Lindem (2008):
OSPF for IPv6.
RFC 5340, Network Working Group.
Available at http://www.ietf.org/rfc/rfc5340.txt.
L. De Moura & N. Bjørner (2008):
Z3: An Efficient SMT Solver.
In: C. R. Ramakrishnan & J. Rehof: Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08),
Lecture Notes in Computer Science 4963.
Springer,
pp. 337–340,
doi:10.1007/978-3-540-78800-3_24.
E. W. Dijkstra (1959):
A Note on Two Problems in Connexion with Graphs.
Numerische Mathematik 1(1),
pp. 269–271,
doi:10.1007/BF01386390.
C. Ene & T. Muntean (2001):
A Broadcast-based Calculus for Communicating Systems.
In: Parallel & Distributed Processing Symposium (IPDPS '01).
IEEE Computer Society,
pp. 1516–1525,
doi:10.1109/IPDPS.2001.925136.
A. Fehnker, R. J. van Glabbeek, P Höfner, A. K. McIver, M. Portmann & W. L. Tan (2012):
Automated Analysis of AODV using UPPAAL.
In: C. Flanagan & B. König: Tools and Algorithms for the Construction and Analysis of Systems (TACAS '12),
Lecture Notes in Computer Science 7214.
Springer,
pp. 173–187,
doi:10.1007/978-3-642-28756-5_13.
A. Fehnker, R. J. van Glabbeek, P. Höfner, A. K. McIver, M. Portmann & W. L. Tan (2012):
A Process Algebra for Wireless Mesh Networks.
In: H. Seidl: European Symposium on Programming (ESOP '12),
Lecture Notes in Computer Science 7211.
Springer,
pp. 295–315,
doi:10.1007/978-3-642-28869-2_15.
A. Fehnker, R. J. van Glabbeek, P. Höfner, A. K. McIver, M. Portmann & W. L. Tan (2013):
A Process Algebra for Wireless Mesh Networks used for Modelling, Verifying and Analysing AODV.
Available at http://arxiv.org/abs/1312.7645.
L. R. Ford Jr. (1956):
Network Flow Theory.
Technical Report Paper P-923.
The RAND Corporation.
F. Ghassemi, W. Fokkink & A. Movaghar (2008):
Restricted Broadcast Process Theory.
In: A. Cerone & S. Gruner: Software Engineering and Formal Methods (SEFM '08).
IEEE Computer Society,
pp. 345–354,
doi:10.1109/SEFM.2008.25.
R. J. van Glabbeek & P. Höfner (2017):
Split, Send, Reassemble: A Formal Specification of a CAN Bus Protocol Stack.
In: H. Hermanns & P. Höfner: Models for Formal Analysis of Real Systems (MARS'17),
Electronic Proceedings in Theoretical Computer Science 244.
Open Publishing Association,
pp. 14–52,
doi:10.4204/EPTCS.244.2.
R. J. van Glabbeek, P. Höfner, W. L. Tan & M. Portmann (2013):
Sequence Numbers Do Not Guarantee Loop Freedom —AODV Can Yield Routing Loops—.
In: Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM '13).
ACM,
pp. 91–100,
doi:10.1145/2507924.2507943.
R. J. van Glabbeek, P. Höfner, M. Portmann & W.L. Tan (2016):
Modelling and Verifying the AODV Routing Protocol.
Distributed Computing 29(4),
pp. 279–315,
doi:10.1007/s00446-015-0262-7.
J. C. Godskesen (2007):
A Calculus for Mobile Ad Hoc Networks.
In: A. L. Murphy & J. Vitek: Coordination Models and Languages (COORDINATION '07),
Lecture Notes in Computer Science 4467.
Springer,
pp. 132–150,
doi:10.1007/978-3-540-72794-1_8.
J. C. Godskesen (2010):
Observables for Mobile and Wireless Broadcasting Systems.
In: D. Clarke & G. A. Agha: Coordination Models and Languages (COORDINATION '10),
Lecture Notes in Computer Science 6116.
Springer,
pp. 1–15,
doi:10.1007/978-3-642-13414-2_1.
C. A. R. Hoare (1985):
Communicating Sequential Processes.
Prentice Hall,
Englewood Cliffs.
ISO/IEC/IEEE 8802-11 (2018):
Information Technology — Telecommunications and information exchange between systems — Local and metropolitan area networks — Specific requirements — Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications.
Available at https://www.iso.org/standard/73367.html.
K. G. Larsen, P. Pettersson & Wang Yi (1997):
UPPAAL in a Nutshell.
International Journal of Software Tools for Technology Transfer 1(1-2),
pp. 134–152,
doi:10.1007/s100090050010.
S.U.R Malik, S. K. Srinivasan & S. U. Khan (2012):
A Methodology for OSPF Routing Protocol Verification.
M. Merro (2009):
An Observational Theory for Mobile Ad Hoc Networks (full version).
Information and Computation 207(2),
pp. 194–208,
doi:10.1016/j.ic.2007.11.010.
N. Mezzetti & D. Sangiorgi (2006):
Towards a Calculus For Wireless Systems.
Electronic Notes in Theoretical Computer Science 158,
pp. 331–353,
doi:10.1016/j.entcs.2006.04.017.
R. Milner (1980):
A Calculus of Communicating Systems.
Lecture Notes in Computer Science 92.
Springer,
doi:10.1007/3-540-10235-3.
R. Milner (1989):
Communication and Concurrency.
Prentice Hall,
Englewood Cliffs.
S. Miskovic & E. W. Knightly (2010):
Routing Primitives for Wireless Mesh Networks: Design, Analysis and Experiments.
In: INFOCOM'10.
IEEE,
pp. 2793–2801,
doi:10.1109/INFCOM.2010.5462111.
K. Möhring (2017):
Transformation of AWN Protocol Specifications to the Uppaal Model Checker.
Bachelor Thesis.
Universität Hamburg and Data61, CSIRO.
E. F. Moore (1957):
The Shortest Path Through a Maze.
Technical Report.
Bell Telephone System.
G. Nakibly, A. Sosnovich, E. Menahem, A. Waizel & Y. Elovici (2014):
OSPF Vulnerability to Persistent Poisoning Attacks: A Systematic Analysis.
In: Computer Security Applications Conference,
ACSAC '14.
ACM,
pp. 336–345,
doi:10.1145/2664243.2664278.
S. Nanz & C. Hankin (2006):
A Framework for Security Analysis of Mobile Wireless Networks.
Theoretical Computer Science 367,
pp. 203–227,
doi:10.1016/j.tcs.2006.08.036.
K. V. S. Prasad (1991):
A Calculus of Broadcasting Systems.
In: S. Abramsky & T. S. E. Maibaum: Theory and Practice of Software Development (TAPSOFT '91),
Lecture Notes in Computer Science 493.
Springer,
pp. 338–358,
doi:10.1007/3-540-53982-4_19.
K. V. S. Prasad (1995):
A Calculus of Broadcasting Systems.
Science of Computer Programming 25(2-3),
pp. 285–327,
doi:10.1016/0167-6423(95)00017-8.
A. Shimbel (1955):
Structure in Communication Nets.
In: Symposium on Information Networks.
Polytechnic Press of the Polytechnic Institute of Brooklyn,
pp. 199–203.
A. Singh, C. R. Ramakrishnan & S. A. Smolka (2010):
A process calculus for Mobile Ad Hoc Networks.
Science of Computer Programming 75,
pp. 440–469,
doi:10.1016/j.scico.2009.07.008.
K. Varadhan, R. Govindan & D. Estrin (2000):
Persistent Route Oscillations in Inter-domain Routing.
Computer Networks 32(1),
pp. 1–16,
doi:10.1016/S1389-1286(99)00108-5.
P. Zave (2011):
Experiences with Protocol Description.
In: Workshop on Rigorous Protocol Engineering (W-RiPE'11).