Decidability of finite probabilistic propositional dynamic logics

DOI10.1016/0890-5401(91)90037-3zbMath0732.03022OpenAlexW1979586773MaRDI 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

undecidabilitydecidabilityfinite model propertyprobabilistic choicefinite Probabilistic Propositional Dynamic Logicglobal assignmentsnesting of probability estimations

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Probability and inductive logic (03B48) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Decidability of theories and sets of sentences (03B25)

Related Items (5)

Extending propositional dynamic logic for Petri nets ⋮ Reasoning about probabilistic sequential programs ⋮ Concurrent program schemes and their logics ⋮ A probabilistic PDL ⋮ Decidability of finite probabilistic propositional dynamic logics

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)

This page was built for publication: Decidability of finite probabilistic propositional dynamic logics