A Proof System for Compositional Verification of Probabilistic Concurrent Processes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

A Proof System for Compositional Verification of Probabilistic Concurrent Processes

Résumé

We present a formal proof system for compositional verifica- tion of probabilistic concurrent processes. Processes are specified using an SOS-style process algebra with probabilistic operators. Properties are expressed using a probabilistic modal μ-calculus. And the proof system is formulated as a sequent calculus in which sequents are given a quan- titative interpretation. A key feature is that the probabilistic scenario is handled by introducing the notion of Markov proof, by which each proof in the system is interpreted as a Markov Decision Process, with the proof only considered valid in the case that the value of the MDP is zero. We present simple but illustrative examples demonstrating the applicability of the approach to the compositional verification of infinite state processes. Our main result is the soundness of the proof system, which is proved by applying the coupling method from probability theory to the game semantics of the probabilistic modal μ-calculus.
Fichier non déposé

Dates et versions

hal-00766384 , version 1 (18-12-2012)

Identifiants

  • HAL Id : hal-00766384 , version 1

Citer

Matteo Mio, Alex Simpson. A Proof System for Compositional Verification of Probabilistic Concurrent Processes. Foundations of Software Science and Computation Structures - 16th International Conference (FOSSACS 2013), Mar 2013, Rome, Italy. pp.161-176. ⟨hal-00766384⟩
353 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More