A logic of probability with decidable model-checking
From MaRDI portal
Recommendations
Cited in
(25)- When are stochastic transition systems tameable?
- The complexity of synchronizing Markov decision processes
- Bounds for synchronizing Markov decision processes
- SLAP: specification logic of actions with probability
- The probability nesting game
- Exogenous probabilistic computation tree logic
- A decidable probability logic for timed probabilistic systems
- A Logic of Probability with Decidable Model Checking
- Decidability and Undecidability in Probability Logic
- A decidable propositional dynamic logic with explicit probabilities
- Some considerations on the logic \(\text{P}_{\text{F}}\text{D}\) -- a logic combining modality and probability
- Computability of validity and satisfiability in probability logics over finite and countable models
- On the satisfiability of some simple probabilistic logics
- Separable GPL: decidable model checking with more non-determinism
- Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
- Monodic fragments of probabilistic first-order logic
- The well-designed logical robot: learning and experience from observations to the Situation Calculus
- Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
- Decission Markov logic
- Approximate verification of the symbolic dynamics of Markov chains
- Probability logic: A model-theoretic perspective
- A probabilistic temporal epistemic logic: decidability
- CTL model checking of MDPs over distribution spaces: algorithms and sampling-based computations
- Decidability of finite probabilistic propositional dynamic logics
- A probabilistic logic based on the acceptability of gambles
This page was built for publication: A logic of probability with decidable model-checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411831)
