@inproceedings{352649f68c4345e5983a6de57906abd6,

title = "A Proof System for Compositional Verification of Probabilistic Concurrent Processes",

abstract = "We present a formal proof system for compositional verification 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 quantitative interpretation. A key feature is that the probabilistic scenario is handled by introducing the notion of Markov proof, according to which proof trees contain probabilistic branches and are required to satisfy a condition formulated by interpreting them as Markov Decision Processes. 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.",

author = "Matteo Mio and Alex Simpson",

year = "2013",

doi = "10.1007/978-3-642-37075-5_11",

language = "English",

isbn = "978-3-642-37074-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer-Verlag GmbH",

pages = "161--176",

editor = "Frank Pfenning",

booktitle = "Foundations of Software Science and Computation Structures",

}