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

Norman, G.

Palamidessi, C.

Parker, D.

Wu, P.

English

International audienceWe 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 pi-calculus literature

Norman, Gethin

Palamidessi, Catuscia

Parker, David

Wu, Peng

HAL-Polytechnique

Model checking probabilistic and stochastic extensions of the $\pi$-calculus

Enlighten

A Calculus of Mobile Processes,

A Compositional Approach to Performance Modelling.

A Framework to Analyze Probabilistic Protocols and Its Application to the Partial Secrets Exchange,”

A Logic Encoding of the -Calculus: Model Checking Mobile Processes Using Tabled Resolution,”

A Logic for Reasoning about Time and Reliability,”

A Randomized Protocol for Signing

A Spatial Logic for Concurrency (Part I),”

A Symbolic Approach to ValuePassing

A Symbolic Semantics for the -Calculus,”

Abstract Interpretation of the -Calculus,”

An Algebraic Verification of a Mobile

Application of a Stochastic Name Passing Calculus to Representation and Simulation

Communication and Concurrency.

Complete Inference Systems for Weak Bisimulation Equivalences in the -Calculus,”

Crowds: Anonymity for Web Transactions,”

Efficient, Correct Simulation of

Interpreting -Calculus with

Model Checking of Probabilistic and Nondeterministic Systems,”

Model Checking the Probabilistic -Calculus,”

PRISM: A Tool for Automatic Verification of Probabilistic Systems,”

Probabilistic Anonymity,”

Probabilistic Asynchronous -Calculus,”

Probabilistic Model Checking of Complex Biological Pathways,”

Probabilistic Simulations for Probabilistic Processes,”

ProVerif: Automatic Cryptographic Protocol Verifier User Manual,

Representation and Simulation

Static Analysis for the -Calculus with Applications to Security,”

Stochastic -Calculus,”

Stochastic Analysis of Mobile Telephony Networks,”

Symbolic Bisimulation and Proof Systems for the -Calculus,” technical report,

Symbolic Bisimulations for Probabilistic Systems,”

The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability,”

Model checking probabilistic and stochastic extensions of the pi-calculus

Abstract

Similar works

Full text

Available Versions

HAL-Polytechnique

Enlighten

INRIA a CCSD electronic archive server

Enlighten: Publications