D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328--350, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
The Metric Analogue of Weak Bisimulation for.. - Desharnais, Jagadeesan, .. (2002) (7 citations) (Correct)
....of approximately inter substitutable. A natural pathway to approximate reasoning is to work with a relaxed notion of truth for example using the interval [0; 1] as the collection of truth values instead of f0; 1g. This is precisely Kozen s seminal idea on logics in the context of probability [Koz81, Koz85] moving from truthvalued boolean functions to real valued (measurable) functions qua logical formulas. This demands that we take a more sophisticated view of the numerical probability values. This idea of the importance of numerical quantities also guides the search for a relaxation of the notion ....
D. Kozen. Semantics of probabilistic programs. Journal of Computer and Systems Sciences, 22:328-350, 1981.
Approximating Labelled Markov Processes - Desharnais, Jagadeesan (2000) (4 citations) (Correct)
....techniques to determine the result of a boolean answer one will not be able to tell when the approximation has converged. This general kind of example of the subtle interaction between approximation and logic leads us to revisit Kozen s seminal ideas on logics in the context of probability [Koz81, Koz85] He argued that in the probabilistic context one should take measurable functions as a natural generalization of logical formulas. Truth values now take values in the interval [0, 1] rather than in the set 0, 1 . A state s is replaced by a distribution over states. Traditionally, ....
....sense. The mixture of nondeterminism and probability is interesting when one is dealing with specifications or in general in situations where one does not know the probability distributions, for example in economics. The foundational work on the use of probability in semantics is due to Kozen [Koz81, Koz85] and SahebDjahromi [SD78, SD80] These are concerned with domain theory and programming languages rather than with process equivalences, but they both introduced nontrivial measure theoretic ideas. Kozen s paper [Koz85] introduces a probabilistic dynamic logic and observes a very ....
D. Kozen. Semantics of probabilistic programs. Journal of Computer and Systems Sciences, 22:328-- 350, 1981.
Linear Structures for Concurrency in Probabilistic.. - Di Pierro, Wiklicky (2001) (Correct)
....the corresponding operators to commute. Example 3.6 Consider, the following two agents: A x : 3 and B x : 4: We introduce probabilities at the algorithmic level, in the parallel and choice constructs. Other approaches are based on a random assignment and use general stochastic matrices [44,30]. 17 ( b] B basic action ( p : A] p [ A] weighted statement ( g A] G [ A] guarded statement A i ] i=1 [ A i ] sequential composition i=1 [ A i ] choice ( k ( proc] A] procedure call Fig. 6. A Generic Fixpoint Operator The semantics ....
....the monotonicity of PCCP computations makes the actual dimension of the semantical matrices smaller than n . In fact, these matrices are uppertriangular, which reduces their dimension to n(n 1) 2 . 6 Related Work The work of Kozen on the semantics of a probabilistic imperative language [43,44] is closely related to our approach. In this work a Banach space is used as semantical domain for a denotational semantics. One main di erence is that our language as well as our semantical treatment includes concurrency. Moreover, probabilities are introduced in our language at the syntactic ....
Kozen, D., Semantics for probabilistic programs, Journal of Computer and System Sciences 22 (1981), pp. 328-350.
Linear Structures for Concurrency in Probabilistic.. - Di Pierro, Wiklicky (2001) (Correct)
....the monotonicity of PCCP computations makes the actual dimension of the semantical matrices smaller than n . In fact, these matrices are uppertriangular, which reduces their dimension to n(n 1) 2 . 6 Related Work The work of Kozen on the semantics of a probabilistic imperative language [43,44] is closely related to our approach. In this work a Banach space is used as semantical domain for a denotational semantics. One main di erence is that our language as well as our semantical treatment includes concurrency. Moreover, probabilities are introduced in our language at the syntactic ....
Kozen, D., Semantics of probabilistic programs, in: 20th Annual Symposium on Foundations of Computer Science (1979), pp. 101-114.
Quantitative Observables and Averages in Probabilistic.. - Di Pierro, Wiklicky (1999) (Correct)
.... previous work by the authors [14] which considers linear spaces structures (Banach or Hilbert spaces of measurable functions) as domain of denotations, in line with earlier important contributions in the area of probabilistic semantics like the fundamental papers of SahebDjahromi [34] and Kozen [30]. A rst result in this direction is the denotational model for average properties which refer to static quantities. These correspond to real valued random variables whose de nition is xed when the process starts and doesn t change during all its execution [15] This context also allows us to ....
Dexter Kozen. Semantics for probabilistic programs. Journal of Computer and System Sciences, 22:328-350, 1981.
A Monadic Probabilistic Language - Park, Pfenning, Thrun (Correct)
....expressions denoting probability distributions from function expressions, which denote functions from values to probability distributions. Thus a function expression corresponds to a sampling expression in our language. The language also provides a binary choice construct e1 orp e2 . Kozen [20] investigates the semantics of probabilistic while programs. A random assignment x: random assigns a random number to a variable x and is the source of probability distributions. It can be thought of as a primitive construct for sampling functions because the variable x can be used later as an ....
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328--350, 1981.
A Probabilistic Language based upon Sampling Functions - Sungwoo Park Frank (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328--350, 1981.
A Probabilistic Language based upon Sampling Functions - Sungwoo Park Frank (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328-- 350, 1981.
Polymorphic Time Systems for Estimating Program - Complexity Vincent Dornic (Correct)
No context found.
Kozen, D. Semantics of probabilistic programs. J. Comput. Syst. Sci. 22 (1981), 328-350.
A Probabilistic Language based upon Sampling Functions - Sungwoo Park Frank (2004) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328--350, 1981.
A Programming Language for Probabilistic Computation - Park (2005) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328-- 350, 1981.
A Quantitative Approach to Noninterference for Probabilistic.. - Aldini, Di Pierro (2003) (Correct)
No context found.
D. Kozen. Semantics of Probabilistic Programs. Journal of Computer and Systems Sciences 22(3):328--350, 1981.
A Probabilistic Language based upon Sampling Functions - Park, Pfenning, Thrun (2004) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328--350, 1981.
Metric Semantics for Reactive Probabilistic Processes - Norman (1997) (7 citations) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer System Science, 22:328-350, 1981.
Probability, Nondeterminism and Concurrency: Two Denotational.. - Varacca (2003) (Correct)
No context found.
Dexter Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22:328--250, 1981.
A Quantitative Approach to Noninterference for Probabilistic.. - Aldini, Di Pierro (2003) (Correct)
No context found.
D. Kozen. Semantics of Probabilistic Programs. Journal of Computer and Systems Sciences 22(3):328-350, 1981.
Randomized Parallel Computation - Rajasekaran, Reif (Correct)
No context found.
Kozen,D., "Semantics of Probabilistic Programs," Journal of Computer and Systems Science, vol.22, 1981, pp.328-350.
Quantitative Relations and Approximate Process Equivalences - Di Pierro, Hankin, Wiklicky (2003) (1 citation) (Correct)
No context found.
D. Kozen. Semantics for probabilistic programs. Journal of Computer and System Sciences, 22:328-350, 1981.
The Metric Analogue of Weak Bisimulation for.. - Desharnais, Jagadeesan, .. (2002) (7 citations) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and Systems Sciences, 22:328--350, 1981.
Duality for Labelled Markov Processes - Michael Mislove Joel (Correct)
No context found.
D. Kozen. The Semantics of Probabilistic Programs. Journal of Computer and System Science, 22:328--350, 1981.
Semantic Domains for Combining Probability and Non-Determinism - Tix, Keimel, Plotkin (2005) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. J. Comp. System Sci., 22:328-350, 1981.
Probabilistic Model Checking of Deadline Properties in .. - Kwiatkowska, Norman.. (6 citations) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328-350, 1981.
A Calculus for Probabilistic Languages - Sungwoo Park School (2003) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22(3):328--350, 1981.
Cost Analysis of Games, Using Program Logic - Morgan, McIver (2001) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22:328-350, 1981. 20
Games, Probability and the Quantitative μ-Calculus - McIver, Morgan (2002) (Correct)
No context found.
D. Kozen. Semantics of probabilistic programs. Journal of Computer and System Sciences, 22:328--350, 1981.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC