Issue No. 02 - March/April (2009 vol. 35)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TSE.2008.77
Gethin Norman , Oxford University, Oxford
Catuscia Palamidessi , INRIA Saclay and École Polytechnique, Paris
David Parker , Oxford University, Oxford
Peng Wu , University College London, Ipswich
We present an implementation of model checking for probabilistic and stochastic extensions of the π-calculus, a process algebra which supports modelling of concurrency and mobility. Formal verification techniques for such extensions have clear applications in several domains, including mobile ad-hoc network protocols, probabilistic security protocols and biological pathways. Despite this, no implementation of automated verification exists. Building upon the π-calculus model checker MMC, we first show an automated procedure for constructing the underlying semantic model of a probabilistic or stochastic π-calculus process. This can then be verified using existing probabilistic model checkers such as PRISM. Secondly, we demonstrate how for processes of a specific structure a more efficient, compositional approach is applicable, which uses our extension of MMC on each parallel component of the system and then translates the results into a high-level modular description for the PRISM tool. The feasibility of our techniques is demonstrated through a number of case studies from the π-calculus literature.
Model checking, Markov processes, Stochastic processes
C. Palamidessi, P. Wu, D. Parker and G. Norman, "Model Checking Probabilistic and Stochastic Extensions of the π-Calculus," in IEEE Transactions on Software Engineering, vol. 35, no. , pp. 209-223, 2008.