Decisive Markov Chains

DOI10.2168/LMCS-3(4:7)2007MaRDI QIDQ5453500zbMATH OpenFDO

Authors Noomene Ben Henda, Parosh A. Abdulla, Richard M. Mayr

Publication date 1 April 2008

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-3(4:7)2007

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Analysing decisive stochastic processes
• Carrying probabilities to the infinite world
• When are stochastic transition systems tameable?
• Reachability problems for Markov chains
• scientific article; zbMATH DE number 1759620

Cited in

(23)

• Controlling a random population
• Model checking probabilistic systems against pushdown specifications
• Skolem and positivity completeness of ergodic Markov chains
• scientific article; zbMATH DE number 7649916 (Why is no real title available?)
• About decisiveness of dynamic probabilistic models
• Qualitative analysis of VASS-induced MDPs
• Decidability of approximate Skolem problem and applications to logical verification of dynamical properties of Markov chains
• scientific article; zbMATH DE number 5183795 (Why is no real title available?)
• Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
• Decisiveness of stochastic systems and its application to hybrid models
• When are stochastic transition systems tameable?
• Eager Markov Chains
• Analysing decisive stochastic processes
• Introducing divergence for infinite probabilistic models
• Nearly optimal verifiable data streaming
• A note on the attractor-property of infinite-state Markov chains
• Probabilistic total store ordering
• On the probabilistic and statistical verification of infinite Markov chains (invited talk)
• Beyond decisiveness of infinite Markov chains
• scientific article; zbMATH DE number 7455746 (Why is no real title available?)
• Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models
• Maximizing the conditional expected reward for reaching the goal
• Carrying probabilities to the infinite world

This page was built for publication: Decisive Markov Chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453500)