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].
Original language | English |
---|---|
Title of host publication | Automata, Languages and Programming - 10th Colloquium |
Editors | Josep Diaz |
Publisher | Springer Verlag |
Pages | 445-457 |
Number of pages | 13 |
ISBN (Print) | 9783540123170 |
DOIs | |
State | Published - 1983 |
Event | 10th International Colloquium on Automata, Languages and Programming, ICALP 1983 - Barcelona, Spain Duration: 18 Jul 1983 → 22 Jul 1983 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 154 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 10th International Colloquium on Automata, Languages and Programming, ICALP 1983 |
---|---|
Country/Territory | Spain |
City | Barcelona |
Period | 18/07/83 → 22/07/83 |
Bibliographical note
Publisher Copyright:© 1983, Springer-Verlag.