Probabilistic propositional temporal logics
From MaRDI portal
Publication:4722046
DOI10.1016/S0019-9958(86)80001-8zbMath0614.03024MaRDI QIDQ4722046
Publication date: 1986
Published in: Information and Control (Search for Journal in Brave)
concurrent programscompletenessMarkov chaindecidabilitysatisfiabilityprobabilistic programssequential programspropositional probabilistic temporal logics
Probability and inductive logic (03B48) Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Decidability of theories and sets of sentences (03B25) General topics in the theory of software (68N01)
Related Items
A calculus of stochastic systems for the specification, simulation, and hidden state estimation of mixed stochastic/nonstochastic systems ⋮ Metrics for labelled Markov processes ⋮ Probabilistic concurrent constraint programming ⋮ Approximating labelled Markov processes ⋮ Satisfiability of quantitative probabilistic CTL: rise to the challenge ⋮ Quantitative model checking of linear-time properties based on generalized possibility measures ⋮ Unnamed Item ⋮ Computation tree logic model checking based on possibility measures ⋮ OBLIGATION BLACKWELL GAMES AND P-AUTOMATA
