Model checking probabilistic and stochastic extensions of the pi-calculus

Norman, G. , Palamidessi, C., Parker, D. and Wu, P. (2009) Model checking probabilistic and stochastic extensions of the pi-calculus. IEEE Transactions on Software Engineering, 35(2-3), pp. 209-223. (doi: 10.1109/TSE.2008.77)

[img] Text


Publisher's URL:


We present an implementation of model checking for probabilistic and stochastic extensions of the pi-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 pi-calculus model checker MMC, we first show an automated procedure for constructing the underlying semantic model of a probabilistic or stochastic pi-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 pi-calculus literature.

Item Type:Articles
Glasgow Author(s) Enlighten ID:Norman, Dr Gethin
Authors: Norman, G., Palamidessi, C., Parker, D., and Wu, P.
Subjects:Q Science > QA Mathematics > QA76 Computer software
College/School:College of Science and Engineering > School of Computing Science
Journal Name:IEEE Transactions on Software Engineering
Journal Abbr.:IEEE trans. softw. eng.
Published Online:19 September 2008

University Staff: Request a correction | Enlighten Editors: Update this record