AbstractThe problem of combining nondeterminism and probability within a denotational model has been the subject of much research. Early work used schedulers to model probabilistic choice, interleaving their execution with that of nondeterministic choice, a theme that continues in some operational models today. More recent work has focused on providing a principled account of the interactions of these operators, with the aim of devising models that support both operators so that neither is related with the other. In this paper we recount the results along this line, and point out some places where further research is warranted
We sketch a process algebra with data and probability distributions. This allows to combine two very...
We sketch a process algebra with data and probability distributions. This allows to combine two very...
Wegiveabriefoverviewofoperationalmodelsforconcurrent systems that exhibit probabilistic behavior, fo...
AbstractThe problem of combining nondeterminism and probability within a denotational model has been...
AbstractThis paper studies a simple calculus for finite-state processes featuring both nondeterminis...
Early support for reasoning about probabilistic system behaviour replaced nondeterminism with probab...
AbstractThis paper studies a simple calculus for finite-state processes featuring both nondeterminis...
AbstractThis work continues ongoing research in combining theories of nondeterminism and probabilist...
Motivated by Moggi's work [34] on how monads can be used to capture computational behavior, there ha...
AbstractThis work continues ongoing research in combining theories of nondeterminism and probabilist...
Abstract. Jones and Plotkin give a general construction for forming a probabilistic powerdomain over...
AbstractWe present domain-theoretic models that support both probabilistic and nondeterministic choi...
non disponibileRandomization was first introduced in computer science in order to improve the effic...
This article has been retracted at the request of the Editor-in-Chief and Author. Please see Elsevie...
Contains fulltext : 27561.pdf (publisher's version ) (Open Access)This thesis is w...
We sketch a process algebra with data and probability distributions. This allows to combine two very...
We sketch a process algebra with data and probability distributions. This allows to combine two very...
Wegiveabriefoverviewofoperationalmodelsforconcurrent systems that exhibit probabilistic behavior, fo...
AbstractThe problem of combining nondeterminism and probability within a denotational model has been...
AbstractThis paper studies a simple calculus for finite-state processes featuring both nondeterminis...
Early support for reasoning about probabilistic system behaviour replaced nondeterminism with probab...
AbstractThis paper studies a simple calculus for finite-state processes featuring both nondeterminis...
AbstractThis work continues ongoing research in combining theories of nondeterminism and probabilist...
Motivated by Moggi's work [34] on how monads can be used to capture computational behavior, there ha...
AbstractThis work continues ongoing research in combining theories of nondeterminism and probabilist...
Abstract. Jones and Plotkin give a general construction for forming a probabilistic powerdomain over...
AbstractWe present domain-theoretic models that support both probabilistic and nondeterministic choi...
non disponibileRandomization was first introduced in computer science in order to improve the effic...
This article has been retracted at the request of the Editor-in-Chief and Author. Please see Elsevie...
Contains fulltext : 27561.pdf (publisher's version ) (Open Access)This thesis is w...
We sketch a process algebra with data and probability distributions. This allows to combine two very...
We sketch a process algebra with data and probability distributions. This allows to combine two very...
Wegiveabriefoverviewofoperationalmodelsforconcurrent systems that exhibit probabilistic behavior, fo...