A note on the attractor-property of infinite-state Markov chains
From MaRDI portal
Publication:1045897
DOI10.1016/J.IPL.2005.09.011zbMATH Open1191.68330OpenAlexW2111172654MaRDI QIDQ1045897FDOQ1045897
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
Recommendations
theory of computationlossy channel systemsattractors in Markov chainsverification of probabilistic systems
Cites Work
- The complexity of probabilistic verification
- Title not available (Why is that?)
- A logic for reasoning about time and reliability
- On Communicating Finite-State Machines
- Markov Chains
- Automatic verification of real-time systems with discrete probability distributions.
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Automata, Languages and Programming
- Computer Aided Verification
- Verification of probabilistic systems with faulty communication
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Validation of Stochastic Systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Measure and probability for concurrency theorists
- Title not available (Why is that?)
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
Uses Software
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)
