Approximate verification of the symbolic dynamics of Markov chains
DOI10.1145/2629417zbMATH Open1321.68367OpenAlexW2021112905WikidataQ131119111 ScholiaQ131119111MaRDI QIDQ5501948FDOQ5501948
Authors: S. Akshay, Blaise Genest, P. S. Thiagarajan, Manindra Agrawal 
Publication date: 14 August 2015
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-00920793/file/AAGT15.pdf
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
Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Markov Chains
- Markov chains and stochastic stability
- A theory of timed automata
- The theory of interval-probability as a unifying concept for uncertainty
- An Introduction to Symbolic Dynamics and Coding
- Non-negative matrices and Markov chains.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- LTL model checking of interval Markov chains
- Constraint Markov chains
- Title not available (Why is that?)
- A logic for reasoning about time and reliability
- CONCUR 2003 - Concurrency Theory
- Discrete time Markov chains with interval probabilities
- Symbolic model checking for probabilistic processes
- Interval-valued finite Markov chains
- Unzerlegbare, nicht negative Matrizen
- Title not available (Why is that?)
- Decision Problems for Interval Markov Chains
- Title not available (Why is that?)
- Model-Checking ω-Regular Properties of Interval Markov Chains
- Approximate verification of the symbolic dynamics of Markov chains
- Symbolic Dynamics
- Wielandt's proof of the exponent inequality for primitive nonnegative matrices
- Title not available (Why is that?)
- Performance Analysis of Communications Networks and Systems
- Decision problems for linear recurrence sequences
- On stochastic languages
Cited In (20)
- Skolem and positivity completeness of ergodic Markov chains
- On robustness for the Skolem, positivity and ultimate positivity problems
- Positivity-hardness results on Markov decision processes
- Algebraic model checking for discrete linear dynamical systems
- 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
- Title not available (Why is that?)
- On the Skolem problem and the Skolem conjecture
- A note on the attractor-property of infinite-state Markov chains
- Incremental Verification of Parametric and Reconfigurable Markov Chains
- What's decidable about discrete linear dynamical systems?
- A probabilistic logic for verifying continuous-time Markov chains
- MDPs as distribution transformers: affine invariant synthesis for safety objectives
- Approximate verification of the symbolic dynamics of Markov chains
- Additive \(N\)-step Markov chains as prototype model of symbolic stochastic dynamical systems with long-range correlations
Uses Software
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)
