Results 1  10
of
30
Bisimulation for Labelled Markov Processes
 Information and Computation
, 1997
"... In this paper we introduce a new class of labelled transition systems  Labelled Markov Processes  and define bisimulation for them. ..."
Abstract

Cited by 139 (23 self)
 Add to MetaCart
In this paper we introduce a new class of labelled transition systems  Labelled Markov Processes  and define bisimulation for them.
Probabilistic Game Semantics
 Computer Science Society
, 2000
"... A category of HO/Nstyle games and probabilistic strategies is developedwhere the possible choices of a strategy are quantified so as to give a measure of the likelihood of seeing a given play. A 2sided die is shown to be universal in this category, in the sense that any strategy breaks down into a ..."
Abstract

Cited by 31 (1 self)
 Add to MetaCart
A category of HO/Nstyle games and probabilistic strategies is developedwhere the possible choices of a strategy are quantified so as to give a measure of the likelihood of seeing a given play. A 2sided die is shown to be universal in this category, in the sense that any strategy breaks down into a composition between some deterministic strategy and that die. The interpretative power of the category is then demonstrated by delineating a Cartesian closed subcategory which provides a fully abstract model of a probabilistic extension of Idealized Algol.
Adequacy for algebraic effects
 In 4th FoSSaCS
, 2001
"... We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the acalculus, a minimal calculus which separates values, effects, and computations and thereby canonises the order of evaluation. This is extended to ..."
Abstract

Cited by 30 (16 self)
 Add to MetaCart
We present a logic for algebraic effects, based on the algebraic representation of computational effects by operations and equations. We begin with the acalculus, a minimal calculus which separates values, effects, and computations and thereby canonises the order of evaluation. This is extended to obtain the logic, which is a classical firstorder multisorted logic with higherorder value and computation types, as in Levy’s callbypushvalue, a principle of induction over computations, a free algebra principle, and predicate fixed points. This logic embraces Moggi’s computational λcalculus, and also, via definable modalities, HennessyMilner logic, and evaluation logic, though Hoare logic presents difficulties. 1
Nondeterminism and Probabilistic Choice: Obeying the Laws
 In Proc. 11th CONCUR, volume 1877 of LNCS
, 2000
"... In this paper we describe how to build semantic models that support both nondeterministic choice and probabilistic choice. Several models exist that support both of these constructs, but none that we know of satisfies all the laws one would like. Using domaintheoretic techniques, we show how models ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
In this paper we describe how to build semantic models that support both nondeterministic choice and probabilistic choice. Several models exist that support both of these constructs, but none that we know of satisfies all the laws one would like. Using domaintheoretic techniques, we show how models can be devised using the "standard model" for probabilistic choice, and then applying modified domaintheoretic models for nondeterministic choice. These models are distinguished by the fact that the expected laws for nondeterministic choice and probabilistic choice remain valid. We also describe some potential applications of our model to aspects of security.
Axioms for Probability and Nondeterminism
 ENTCS
, 2003
"... This paper presents a domain model for a process algebra featuring both probabilistic and nondeterministic choice. The former is modelled using the probabilistic powerdomain of Jones and Plotkin, while the latter is modelled by a geometrically convex variant of the Plotkin powerdomain. The main resu ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
This paper presents a domain model for a process algebra featuring both probabilistic and nondeterministic choice. The former is modelled using the probabilistic powerdomain of Jones and Plotkin, while the latter is modelled by a geometrically convex variant of the Plotkin powerdomain. The main result is to show that the expected laws for probability and nondeterminism are sound and complete with respect to the model. We also present an operational semantics for the process algebra, and we show that the domain model is fully abstract with respect to probabilistic bisimilarity.
Topological and Limitspace subcategories of Countablybased Equilogical Spaces
, 2001
"... this paper we show that the two approaches are equivalent for a ..."
Abstract

Cited by 22 (4 self)
 Add to MetaCart
this paper we show that the two approaches are equivalent for a
Concurrent Constraint Programming: Towards Probabilistic Abstract Interpretation
 Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science, MFCS'98, Lecture Notes in Computer Science
, 2000
"... We present a method for approximating the semantics of probabilistic programs to the purpose of constructing semanticsbased analyses of such programs. The method resembles the one based on Galois connection as developed in the Cousot framework for abstract interpretation. The main difference betwee ..."
Abstract

Cited by 20 (8 self)
 Add to MetaCart
We present a method for approximating the semantics of probabilistic programs to the purpose of constructing semanticsbased analyses of such programs. The method resembles the one based on Galois connection as developed in the Cousot framework for abstract interpretation. The main difference between our approach and the standard theory of abstract interpretation is the choice of linear space structures instead of ordertheoretic ones as semantical (concrete and abstract) domains. We show that our method generates "best approximations" according to an appropriate notion of precision defined in terms of a norm. Moreover, if recasted in a ordertheoretic setting these approximations are correct in the sense of classical abstract interpretation theory. We use Concurrent ...
Semantic Domains for Combining Probability and NonDeterminism
 ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE
, 2005
"... ..."
The probabilistic powerdomain for stably compact spaces
 Theoretical Computer Science
"... This paper reviews the onetoone correspondence between stably compact spaces (a topological concept covering most classes of semantic domains) and compact ordered Hausdorff spaces. The correspondence is extended to certain classes of realvalued functions on these spaces. This is the basis for tra ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
This paper reviews the onetoone correspondence between stably compact spaces (a topological concept covering most classes of semantic domains) and compact ordered Hausdorff spaces. The correspondence is extended to certain classes of realvalued functions on these spaces. This is the basis for transferring methods and results from functional analysis to the nonHausdorff setting. As an application of this, the Riesz Representation Theorem is used for a straightforward proof of the (known) fact that every valuation on a stably compact space extends uniquely to a Radon measure on the Borel algebra of the corresponding compact Hausdorff space. The view of valuations and measures as certain linear functionals on function spaces suggests considering a weak topology for the space of all valuations. If these are restricted to the probabilistic or subprobabilistic case, then another stably compact space is obtained. The corresponding compact ordered space can be viewed as the set of (probability or subprobability) measures together with their natural weak topology. 1
An Intrinsic Characterization of Approximate Probabilistic Bisimilarity
 In: Proceedings of FOSSACS 03. LNCS
, 2003
"... Abstract. In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compute than (exact) bisimilarity. The main technical tool used in the underlying theory was the Hutchinson metric o ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
Abstract. In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compute than (exact) bisimilarity. The main technical tool used in the underlying theory was the Hutchinson metric on probability measures. This paper gives a more fundamental characterization of approximate bisimilarity in terms of the notion of (exact) similarity. In particular, we show that the topology of approximate bisimilarity is the Lawson topology with respect to the simulation preorder. To complement this abstract characterization we give a statistical account of similarity, and by extension, of approximate bisimilarity, in terms of the process testing formalism of Larsen and Skou. 1