Decidability of finite probabilistic propositional dynamic logics

DOI10.1016/0890-5401(91)90037-3zbMath0732.03022MaRDI QIDQ809069

N. E. Zubov

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90037-3

zbMATH Keywords

undecidability; decidability; finite model property; probabilistic choice; finite Probabilistic Propositional Dynamic Logic; global assignments; nesting of probability estimations

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03B48: Probability and inductive logic

03B70: Logic in computer science

68Q55: Semantics in the theory of computing

03B25: Decidability of theories and sets of sentences

Related Items

Decidability of finite probabilistic propositional dynamic logics, A probabilistic PDL, Concurrent program schemes and their logics, Reasoning about probabilistic sequential programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A probabilistic dynamic logic
• Decidability of finite probabilistic propositional dynamic logics
• Propositional dynamic logic with local assignments
• A probabilistic PDL
• Semantics of probabilistic programs
• Expressing program looping in regular dynamic logic
• First-order dynamic logic
• Propositional dynamic logic of regular programs
• Verification of Probabilistic Programs
• A decidable propositional dynamic logic with explicit probabilities
• A practical decision method for propositional dynamic logic (Preliminary Report)