Sliding Window Abstraction for Infinite Markov Chains

DOI10.1007/978-3-642-02658-4_27MaRDI QIDQ3636872zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Three-Valued Abstraction for Continuous-Time Markov Chains
• Abstraction for Stochastic Systems by Erlang’s Method of Stages
• Tools and Algorithms for the Construction and Analysis of Systems
• On-the-fly verification and optimization of DTA-properties for large Markov chains
• Quantitative Approximation of the Probability Distribution of a Markov Process by Formal Abstractions

Cited in

(21)

• Three-valued abstraction for probabilistic systems
• Process calculi for biological processes
• Efficient approximation of optimal control for continuous-time Markov games
• Approximation of event probabilities in noisy cellular processes
• Abstraction-guided truncations for stationary distributions of Markov population models
• Analyzing oscillatory behavior with formal methods
• Lumpability abstractions of rule-based systems
• Abstraction-based segmental simulation of chemical reaction networks
• Three-Valued Abstraction for Continuous-Time Markov Chains
• Quantitative analysis of communication scenarios
• The complexity of synchronizing Markov decision processes
• Coarse-graining the dynamics of ideal branched polymers
• On Abstraction of Probabilistic Systems
• Variance reduction in stochastic reaction networks using control variates
• Analysis of Markov jump processes under terminal constraints
• Conditional Monte Carlo for reaction networks
• A note on general sliding window processes
• On-the-fly uniformization of time-inhomogeneous infinite Markov population models
• A linear process-algebraic format with data for probabilistic automata
• Formalisms for Specifying Markovian Population Models
• Approximating probabilistic behaviors of biological systems using abstract interpretation

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

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