Decisive Markov Chains

DOI10.2168/LMCS-3(4:7)2007zbMATH Open1131.68060MaRDI QIDQ5453500FDOQ5453500

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)

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

Mathematics Subject Classification ID

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

Cited In (16)

• Model checking probabilistic systems against pushdown specifications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Simple stochastic games with almost-sure energy-parity objectives are in NP and conp
• Decisiveness of stochastic systems and its application to hybrid models
• Maximizing the Conditional Expected Reward for Reaching the Goal
• When are stochastic transition systems tameable?
• Eager Markov Chains
• Introducing divergence for infinite probabilistic models
• Probabilistic total store ordering
• A note on the attractor-property of infinite-state Markov chains
• Title not available (Why is that?)
• Nearly Optimal Verifiable Data Streaming
• Overcoming memory weakness with unified fairness. Systematic verification of liveness in weak memory models
• Carrying probabilities to the infinite world
• Controlling a random population

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)