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

DOI10.1016/J.IPL.2005.09.011MaRDI QIDQ1045897zbMATH OpenOpenAlexFDO

Authors Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

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)

Recommendations

• Decisive Markov Chains
• Approximate verification of the symbolic dynamics of Markov chains
• Eager Markov Chains
• Carrying probabilities to the infinite world
• Approximate verification of the symbolic dynamics of Markov chains

Cites work

• scientific article; zbMATH DE number 176728 (Why is no real title available?)
• scientific article; zbMATH DE number 1956504 (Why is no real title available?)
• scientific article; zbMATH DE number 1956509 (Why is no real title available?)
• scientific article; zbMATH DE number 2038771 (Why is no real title available?)
• scientific article; zbMATH DE number 3240812 (Why is no real title available?)
• A logic for reasoning about time and reliability
• Automata, Languages and Programming
• Automatic verification of real-time systems with discrete probability distributions.
• Computer Aided Verification
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Markov Chains
• Measure and probability for concurrency theorists
• On Communicating Finite-State Machines
• The complexity of probabilistic verification
• Tools and Algorithms for the Construction and Analysis of Systems
• Validation of Stochastic Systems
• Verification of probabilistic systems with faulty communication

Cited in

(5)

• Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness
• A Markov process for a continuum infinite particle system with attraction
• Deciding probabilistic bisimilarity over infinite-state probabilistic systems
• Probabilistic total store ordering
• Computable fixpoints in well-structured symbolic model checking

Describes a project that uses

Uses Software

• PRISM

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

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