Using probabilistic model checking in systems biology
ACM SIGMETRICS Performance Evaluation Review
Modelling the Tunability of Early T Cell Signalling Events
ICARIS '08 Proceedings of the 7th international conference on Artificial Immune Systems
On automated verification of probabilistic programs
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
An Epistemic Predicate CTL* for Finite Control π-Processes
Electronic Notes in Theoretical Computer Science (ENTCS)
mctau: bridging the gap between modest and UPPAAL
SPIN'12 Proceedings of the 19th international conference on Model Checking Software
| Hi-index | 0.00 |
We present an implementation of model checking for the probabilistic \pi-calculus, a process algebra which supports modelling of concurrency, mobility and discrete probabilistic behaviour. Formal verification techniques for this calculus have clear applications in several domains, including mobile ad-hoc network protocols and random security protocols. Despite this, no implementation of automated verification exists. Building upon the (non-probabilistic) \pi- calculus model checker MMC, we first show an automated procedure for constructing the Markov decision process representing a probabilistic \pi-calculus process. This can then be verified using existing probabilistic model checkers such as PRISM. Secondly, we demonstrate how for a large class of systems a more efficient, compositional approach can be applied, which uses our extension of MMC on each parallel component of the system and then translates the results into a high-level model description for the PRISM tool. The feasibility of our techniques is demonstrated through three case studies from the \pi-calculus literature.