AbstractWe generalise the classical notion of stationary distributions of Markov processes to a model of probabilistic programs which includes demonic nondeterminism. As well as removing some of the conditions normally required for stationarity, our generalisation allows the development of a complete theory linking stationary behaviour to long-term average behaviour — the latter being an important property that lies outside the expressive range of standard logics for probabilistic programs
A propositional version of Feldman and Harel's PrDL (1982, “14th ACM Sympos. on Theory of Computing,...
AbstractIn this paper, we investigate the semantic intricacies of conditioning in probabilistic prog...
AbstractThis paper studies a simple calculus for finite-state processes featuring both nondeterminis...
AbstractWe generalise the classical notion of stationary distributions of Markov processes to a mode...
AbstractThis paper presents two complementary but equivalent semantics for a high level probabilisti...
AbstractIn this paper we show how quantitative program logic (Morgan et al., ACM Trans. Programming ...
version corrigée de quelques scoriesThe study of probabilistic programs is of considerable interest ...
Early support for reasoning about probabilistic system behaviour replaced nondeterminism with probab...
The temporal propositional logic of linear time is generalized to an uncertain world, in which rando...
This paper presents a range of approaches to the analysis and development of program specifications ...
AbstractThis paper introduces a general framework of probabilistic and nondeterministic recursive pr...
Markov processes are a fundamental model of probabilistic transition systems and are the underlying ...
non disponibileRandomization was first introduced in computer science in order to improve the effic...
Probabilistic logic programs combine the power of a programming language with a possible world sema...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
A propositional version of Feldman and Harel's PrDL (1982, “14th ACM Sympos. on Theory of Computing,...
AbstractIn this paper, we investigate the semantic intricacies of conditioning in probabilistic prog...
AbstractThis paper studies a simple calculus for finite-state processes featuring both nondeterminis...
AbstractWe generalise the classical notion of stationary distributions of Markov processes to a mode...
AbstractThis paper presents two complementary but equivalent semantics for a high level probabilisti...
AbstractIn this paper we show how quantitative program logic (Morgan et al., ACM Trans. Programming ...
version corrigée de quelques scoriesThe study of probabilistic programs is of considerable interest ...
Early support for reasoning about probabilistic system behaviour replaced nondeterminism with probab...
The temporal propositional logic of linear time is generalized to an uncertain world, in which rando...
This paper presents a range of approaches to the analysis and development of program specifications ...
AbstractThis paper introduces a general framework of probabilistic and nondeterministic recursive pr...
Markov processes are a fundamental model of probabilistic transition systems and are the underlying ...
non disponibileRandomization was first introduced in computer science in order to improve the effic...
Probabilistic logic programs combine the power of a programming language with a possible world sema...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
A propositional version of Feldman and Harel's PrDL (1982, “14th ACM Sympos. on Theory of Computing,...
AbstractIn this paper, we investigate the semantic intricacies of conditioning in probabilistic prog...
AbstractThis paper studies a simple calculus for finite-state processes featuring both nondeterminis...