Probabilistic Model Checking of AODV

Kamali, Mojgan; Katoen, Joost-Pieter

doi:10.1007/978-3-030-59854-9_6

Cited by 1 publication

(5 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea is to first obtain a finite pMDP that is equivalent to the pPTA for the property at hand, and to then apply parameter space partitioning on the pMDP. In the application to AODV, a real-world case study [39], our experiments showed encouraging results, thereby highlighting the usefulness of parametric PTA, our approach, and its implementation.…”

Section: Discussionmentioning

confidence: 73%

“…In FW, the parameter is the probability to select between the slow and the fast path. Additionally, we consider the probabilistic version of the AODV routing protocol [39], which so far had been analysed for selected concrete message loss probabilities only. It comes in two variants, one with routing error (AODV) and one without (AODV-n).…”

Section: Discussionmentioning

confidence: 99%

“…Now that toolchain for pPTA exists, we would like to study more pPTA case studies; the authors would be happy to assist application experts (e.g. in wireless networks [39]) in modelling and by tuning the tools. Interesting future directions to extend our work are to combine parametrised probabilities with parameters in clock constraints (likely focusing on decidable subclasses as mentioned in Sect.…”

Section: Discussionmentioning

confidence: 99%

“…They have been fruitfully applied to verify performance and reliability aspects of communication protocols and networked systems, see e.g. [22][23][24]39].…”

Section: Introductionmentioning

confidence: 99%

“…5). For the evaluation, we extend all suitable PTA from the Quantitative Verification Benchmark Set (QVBS) [30] with parameters, and additionally study pPTA models of the AODV wireless routing protocol [39]. The latter solves a critical open problem the previous study of the protocol, which had to resort to "testing" by model checking a finite set of selected values for probabilities that are actually unknown.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Tweaking the Odds in Probabilistic Timed Automata

Hartmanns

Katoen

Kohlen

et al. 2021

Quantitative Evaluation of Systems

Self Cite

View full text Add to dashboard Cite

We consider probabilistic timed automata (PTA) in which probabilities can be parameters, i.e. symbolic constants. They are useful to model randomised real-time systems where exact probabilities are unknown, or where the probability values should be optimised. We prove that existing techniques to transform probabilistic timed automata into equivalent finite-state Markov decision processes (MDPs) remain correct in the parametric setting, using a systematic proof pattern. We implemented two of these parameter-preserving transformations-using digital clocks and backwards reachability-in the Modest Toolset. Using Storm's parameter space partitioning approach, parameter values can be efficiently synthesized in the resulting parametric MDPs. We use several case studies from the literature of varying state and parameter space sizes to experimentally evaluate the performance and scalability of this novel analysis trajectory for parametric PTA.

show abstract

Section: Discussionmentioning

confidence: 73%

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

“…They have been fruitfully applied to verify performance and reliability aspects of communication protocols and networked systems, see e.g. [22][23][24]39].…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations