Location of Repository

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:
oai:eprints.gla.ac.uk:39680

Provided by:
Enlighten

Downloaded from
http://eprints.gla.ac.uk/39680/1/04626962.pdf

- (1992). A Calculus of Mobile Processes,
- (1996). A Compositional Approach to Performance Modelling.
- (2005). A Framework to Analyze Probabilistic Protocols and Its Application to the Partial Secrets Exchange,”
- (2004). A Logic Encoding of the -Calculus: Model Checking Mobile Processes Using Tabled Resolution,”
- (1994). A Logic for Reasoning about Time and Reliability,”
- (1985). A Randomized Protocol for Signing
- (2003). A Spatial Logic for Concurrency (Part I),”
- (2001). A Symbolic Approach to ValuePassing
- (1996). A Symbolic Semantics for the -Calculus,”
- (1996). Abstract Interpretation of the -Calculus,”
- (1992). An Algebraic Verification of a Mobile
- (2001). Application of a Stochastic Name Passing Calculus to Representation and Simulation
- (1989). Communication and Concurrency.
- (2003). Complete Inference Systems for Weak Bisimulation Equivalences in the -Calculus,”
- (1998). Crowds: Anonymity for Web Transactions,”
- (2007). Efficient, Correct Simulation of
- (2003). Interpreting -Calculus with
- (1995). Model Checking of Probabilistic and Nondeterministic Systems,”
- (2007). Model Checking the Probabilistic -Calculus,”
- (2006). PRISM: A Tool for Automatic Verification of Probabilistic Systems,”
- (2005). Probabilistic Anonymity,”
- (2000). Probabilistic Asynchronous -Calculus,”
- (2006). Probabilistic Model Checking of Complex Biological Pathways,”
- (1995). Probabilistic Simulations for Probabilistic Processes,”
- (2005). ProVerif: Automatic Cryptographic Protocol Verifier User Manual,
- (2001). Representation and Simulation
- (2001). Static Analysis for the -Calculus with Applications to Security,”
- (1995). Stochastic -Calculus,”
- (1997). Stochastic Analysis of Mobile Telephony Networks,”
- (1994). Symbolic Bisimulation and Proof Systems for the -Calculus,” technical report,
- (2007). Symbolic Bisimulations for Probabilistic Systems,”
- (1988). The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability,”
- (1994). The Mobility Workbench—A Tool for the -Calculus,”
- (1997). The Theory and Practice of Concurrency.
- (2007). Translating the Probabilistic -Calculus to PRISM,”
- (2002). Types as Models: Model Checking Message-Passing Programs,”
- (2003). Verifying -Calculus Processes by Promela Translation,”
- (1996). Verifying Continuous Time Markov Chains,”
- (2003). Watchdog Transformations for Property-Oriented Model-Checking,”

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