Sliding Window Abstraction for Infinite Markov Chains
Abstract elided by the publisher.
Related papers
- Model Checking Infinite-State Markov Chains TACAS 2005
- Using Compositional Preorders in the Verification of Sliding Window Protocal CAV 1997
- Verification and Improvement of the Sliding Window Protocol TACAS 2003
- Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus ESOP 2018
- Quantitative Static Analysis of Communication Protocols Using Abstract Markov Chains SAS 2017
- Three-Valued Abstraction for Continuous-Time Markov Chains CAV 2007
- On the Almost-Sure Termination of Probabilistic Counter Programs CAV 2025
- Probabilistic Total Store Ordering ESOP 2022