Skip to main content
Article thumbnail
Location of Repository

Model checking probabilistic and stochastic extensions of the pi-calculus

By G. Norman, C. Palamidessi, D. Parker and P. Wu


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

Topics: QA76
Publisher: IEEE
Year: 2009
OAI identifier:
Provided by: Enlighten

Suggested articles


  1. (1992). A Calculus of Mobile Processes, doi
  2. (1996). A Compositional Approach to Performance Modelling. doi
  3. (2005). A Framework to Analyze Probabilistic Protocols and Its Application to the Partial Secrets Exchange,” doi
  4. (2004). A Logic Encoding of the -Calculus: Model Checking Mobile Processes Using Tabled Resolution,” doi
  5. (1994). A Logic for Reasoning about Time and Reliability,” doi
  6. (1985). A Randomized Protocol for Signing doi
  7. (2003). A Spatial Logic for Concurrency (Part I),” doi
  8. (2001). A Symbolic Approach to ValuePassing
  9. (1996). A Symbolic Semantics for the -Calculus,” doi
  10. (1996). Abstract Interpretation of the -Calculus,” doi
  11. (1992). An Algebraic Verification of a Mobile doi
  12. (2001). Application of a Stochastic Name Passing Calculus to Representation and Simulation doi
  13. (1989). Communication and Concurrency.
  14. (2003). Complete Inference Systems for Weak Bisimulation Equivalences in the -Calculus,” doi
  15. (1998). Crowds: Anonymity for Web Transactions,” doi
  16. (2007). Efficient, Correct Simulation of doi
  17. (2003). Interpreting -Calculus with
  18. (1995). Model Checking of Probabilistic and Nondeterministic Systems,” doi
  19. (2007). Model Checking the Probabilistic -Calculus,” doi
  20. (2006). PRISM: A Tool for Automatic Verification of Probabilistic Systems,” doi
  21. (2005). Probabilistic Anonymity,” doi
  22. (2000). Probabilistic Asynchronous -Calculus,” doi
  23. (2006). Probabilistic Model Checking of Complex Biological Pathways,” doi
  24. (1995). Probabilistic Simulations for Probabilistic Processes,” doi
  25. (2005). ProVerif: Automatic Cryptographic Protocol Verifier User Manual,
  26. (2001). Representation and Simulation doi
  27. (2001). Static Analysis for the -Calculus with Applications to Security,” doi
  28. (1995). Stochastic -Calculus,” doi
  29. (1997). Stochastic Analysis of Mobile Telephony Networks,”
  30. (1994). Symbolic Bisimulation and Proof Systems for the -Calculus,” technical report,
  31. (2007). Symbolic Bisimulations for Probabilistic Systems,” doi
  32. (1988). The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability,” doi
  33. (1994). The Mobility Workbench—A Tool for the -Calculus,” doi
  34. (1997). The Theory and Practice of Concurrency. doi
  35. (2007). Translating the Probabilistic -Calculus to PRISM,” doi
  36. (2002). Types as Models: Model Checking Message-Passing Programs,” doi
  37. (2003). Verifying -Calculus Processes by Promela Translation,”
  38. (1996). Verifying Continuous Time Markov Chains,” doi
  39. (2003). Watchdog Transformations for Property-Oriented Model-Checking,” doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.