Model checking the probabilistic pi-calculus

Gethin Norman, Catuscia Palamidessi, David Parker, Peng Wu
2007 Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007)  
We present an implementation of model checking for the probabilistic π-calculus, a process algebra which supports modelling of concurrency, mobility and discrete probabilistic behaviour. Formal verification techniques for this calculus have clear applications in several domains, including mobile ad-hoc network protocols and random security protocols. Despite this, no implementation of automated verification exists. Building upon the (non-probabilistic) π-calculus model checker MMC, we first
more » ... an automated procedure for constructing the Markov decision process representing a probabilistic πcalculus process. This can then be verified using existing probabilistic model checkers such as PRISM. Secondly, we demonstrate how for a large class of systems a more efficient, compositional approach can be applied, which uses our extension of MMC on each parallel component of the system and then translates the results into a highlevel model description for the PRISM tool. The feasibility of our techniques is demonstrated through three case studies from the π-calculus literature.
doi:10.1109/qest.2007.31 dblp:conf/qest/NormanPPW07 fatcat:fnxykmrjtbbhlmfot5csjvchg4