A note on the attractor-property of infinite-state Markov chains

DOI10.1016/J.IPL.2005.09.011zbMath1191.68330OpenAlexW2111172654MaRDI QIDQ1045897

Christel Baier, Philippe Schnoebelen, Nathalie Bertrand

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.09.011

zbMATH Keywords

theory of computationlossy channel systemsattractors in Markov chainsverification of probabilistic systems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Probabilistic total store ordering ⋮ Computable fixpoints in well-structured symbolic model checking ⋮ Deciding probabilistic bisimilarity over infinite-state probabilistic systems ⋮ Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness

Uses Software

• PRISM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logic for reasoning about time and reliability
• Measure and probability for concurrency theorists
• Automatic verification of real-time systems with discrete probability distributions.
• Verification of probabilistic systems with faulty communication
• On Communicating Finite-State Machines
• Markov Chains
• The complexity of probabilistic verification
• Computer Aided Verification
• Validation of Stochastic Systems
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Tools and Algorithms for the Construction and Analysis of Systems
• Automata, Languages and Programming

This page was built for publication: A note on the attractor-property of infinite-state Markov chains