Sliding Window Abstraction for Infinite Markov Chains

DOI10.1007/978-3-642-02658-4_27zbMath1242.60079OpenAlexW1535517661MaRDI QIDQ3636872

Maria Mateescu, Verena Wolf, Thomas A. Henzinger

Publication date: 30 June 2009

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_27

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Biochemistry, molecular biology (92C40) Systems biology, networks (92C42)

Related Items (17)

Abstraction-guided truncations for stationary distributions of Markov population models ⋮ Conditional Monte Carlo for Reaction Networks ⋮ Analyzing Oscillatory Behavior with Formal Methods ⋮ On Abstraction of Probabilistic Systems ⋮ Quantitative Analysis of Communication Scenarios ⋮ Process calculi for biological processes ⋮ Variance reduction in stochastic reaction networks using control variates ⋮ Lumpability abstractions of rule-based systems ⋮ Three-valued abstraction for probabilistic systems ⋮ The complexity of synchronizing Markov decision processes ⋮ Approximation of event probabilities in noisy cellular processes ⋮ Analysis of Markov jump processes under terminal constraints ⋮ Coarse-graining the dynamics of ideal branched polymers ⋮ Formalisms for Specifying Markovian Population Models ⋮ A linear process-algebraic format with data for probabilistic automata ⋮ Abstraction-based segmental simulation of chemical reaction networks ⋮ Efficient approximation of optimal control for continuous-time Markov games

This page was built for publication: Sliding Window Abstraction for Infinite Markov Chains