Approximate verification of the symbolic dynamics of Markov chains
From MaRDI portal
Publication:5501948
Recommendations
- Approximate verification of the symbolic dynamics of Markov chains
- Verification, Model Checking, and Abstract Interpretation
- Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
- Computer Aided Verification
- Probabilistic verification and approximation
Cites work
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 3145626 (Why is no real title available?)
- scientific article; zbMATH DE number 599132 (Why is no real title available?)
- scientific article; zbMATH DE number 1948170 (Why is no real title available?)
- scientific article; zbMATH DE number 1507210 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- scientific article; zbMATH DE number 965581 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A logic for reasoning about time and reliability
- A theory of timed automata
- An Introduction to Symbolic Dynamics and Coding
- Approximate verification of the symbolic dynamics of Markov chains
- CONCUR 2003 - Concurrency Theory
- Constraint Markov chains
- Decision Problems for Interval Markov Chains
- Decision problems for linear recurrence sequences
- Discrete time Markov chains with interval probabilities
- Interval-valued finite Markov chains
- LTL model checking of interval Markov chains
- Markov Chains
- Markov chains and stochastic stability
- Model-Checking ω-Regular Properties of Interval Markov Chains
- Non-negative matrices and Markov chains.
- On stochastic languages
- Performance Analysis of Communications Networks and Systems
- Symbolic Dynamics
- Symbolic model checking for probabilistic processes
- The theory of interval-probability as a unifying concept for uncertainty
- Unzerlegbare, nicht negative Matrizen
- Wielandt's proof of the exponent inequality for primitive nonnegative matrices
Cited in
(20)- Skolem and positivity completeness of ergodic Markov chains
- On robustness for the Skolem, positivity and ultimate positivity problems
- Algebraic model checking for discrete linear dynamical systems
- Positivity-hardness results on Markov decision processes
- Constrained Markov order surrogates
- Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
- Distributed Markov chains
- A theory of distributed Markov chains
- Reachability problems for Markov chains
- Complexity of Restricted Variants of Skolem and Related Problems
- Finite horizon analysis of Markov chains with the Mur\(\varphi \) verifier
- scientific article; zbMATH DE number 7559425 (Why is no real title available?)
- A note on the attractor-property of infinite-state Markov chains
- On the Skolem problem and the Skolem conjecture
- Incremental Verification of Parametric and Reconfigurable Markov Chains
- What's decidable about discrete linear dynamical systems?
- Approximate verification of the symbolic dynamics of Markov chains
- A probabilistic logic for verifying continuous-time Markov chains
- MDPs as distribution transformers: affine invariant synthesis for safety objectives
- Additive \(N\)-step Markov chains as prototype model of symbolic stochastic dynamical systems with long-range correlations
This page was built for publication: Approximate verification of the symbolic dynamics of Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501948)
