Title
Reasoning with Time and Chance (Extended Abstract)
Abstract
The temporal propositional logic of linear time is generalized to an uncertain world, in which random events may occur. The formulas do not mention probabilities explicitly, i.e. the only probability appearing explicitly in formulas is probability one. This logic is claimed to be useful for stating and proving properties of probabilistic programs. It is convenient for proving those properties that do not depend on the specific distribution of probabilities used in the program's random draws. The formulas describe properties of execution sequences. The models are stochastic systems, with state transition probabilities. Three different axiomatic systems are proposed and shown complete for general models, finite models and models with bounded transition probabilities respectively. All three systems are decidable, by the results of Rabin [Ra1].
Year
DOI
Venue
1983
10.1007/BFb0036928
ICALP
Keywords
Field
DocType
extended abstract,state transition,propositional logic,transition probability,linear time
Discrete mathematics,Combinatorics,Computer science,Zeroth-order logic,Propositional variable
Conference
ISBN
Citations 
PageRank 
3-540-12317-2
3
6.09
References 
Authors
9
2
Name
Order
Citations
PageRank
Daniel J. Lehmann11270330.79
Saharon Shelah21556440.53