Add to ORKGWe provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of probabilistic automata modulo probabilistic simulation. We use the resulting algebra to generalise the algebraic formulation of a variant of Jones ’ rely/guarantee calculus.
This work is devoted to formal reasoning on relational properties of probabilistic imperative progra...
This thesis aims to provide a path to abstraction between probabilistic systems and non-probabilisti...
AbstractWe propose a method for verification of probabilistic distributed systems in which a variati...
We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The a...
This thesis provides an algebraic modelling and verification of probabilistic concurrent systems in ...
Theoretical thesis.Bibliography: pages 167-175.1. Introduction -- 2. Continuity in probabilistic Kle...
Jones ’ rely-guarantee calculus [1] for shared variable concurrency is ex-tended to include probabil...
We give a new true-concurrent model for probabilistic concurrent Kleene algebra. The model is based ...
We show that a class of automata modulo simulation equivalence forms a model of probabilistic Kleene...
We describe pKA, a probabilistic Kleene-style algebra, based on a well known model of probabilistic/...
We propose a method for verification of probabilistic distributed systems in which a variation of Ko...
This thesis presents a variety of models for probabilistic programming languages in the framework of...
AbstractThis paper introduces a general framework of probabilistic and nondeterministic recursive pr...
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to t...
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior...
This work is devoted to formal reasoning on relational properties of probabilistic imperative progra...
This thesis aims to provide a path to abstraction between probabilistic systems and non-probabilisti...
AbstractWe propose a method for verification of probabilistic distributed systems in which a variati...
We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The a...
This thesis provides an algebraic modelling and verification of probabilistic concurrent systems in ...
Theoretical thesis.Bibliography: pages 167-175.1. Introduction -- 2. Continuity in probabilistic Kle...
Jones ’ rely-guarantee calculus [1] for shared variable concurrency is ex-tended to include probabil...
We give a new true-concurrent model for probabilistic concurrent Kleene algebra. The model is based ...
We show that a class of automata modulo simulation equivalence forms a model of probabilistic Kleene...
We describe pKA, a probabilistic Kleene-style algebra, based on a well known model of probabilistic/...
We propose a method for verification of probabilistic distributed systems in which a variation of Ko...
This thesis presents a variety of models for probabilistic programming languages in the framework of...
AbstractThis paper introduces a general framework of probabilistic and nondeterministic recursive pr...
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to t...
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior...
This work is devoted to formal reasoning on relational properties of probabilistic imperative progra...
This thesis aims to provide a path to abstraction between probabilistic systems and non-probabilisti...
AbstractWe propose a method for verification of probabilistic distributed systems in which a variati...