Skolem and positivity completeness of ergodic Markov chains
From MaRDI portal
Publication:6551702
DOI10.1016/J.IPL.2024.106481zbMATH Open1541.68228MaRDI QIDQ6551702
Publication date: 7 June 2024
Published in: Information Processing Letters (Search for Journal in Brave)
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reachability problems for Markov chains
- Nonparametric statistics for stochastic processes
- Reprint: An arithmetic property of Taylor coefficients of rational functions (1935)
- Einige Sätze über \(p\)-adische Potenzreihen mit Anwendung auf gewisse exponentielle Gleichungen.
- A note on recurring series
- A Logic of Probability with Decidable Model Checking
- Deux propriétés décidables des suites récurrentes linéaires
- On the Positivity Problem for Simple Linear Recurrence Sequences,
- Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
- Positivity Problems for Low-Order Linear Recurrence Sequences
- Approximate Verification of the Symbolic Dynamics of Markov Chains
- Generalized Automata and Stochastic Languages
- MDPs as distribution transformers: affine invariant synthesis for safety objectives
- Skolem meets schanuel
This page was built for publication: Skolem and positivity completeness of ergodic Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551702)
