Pages that link to "Item:Q3636872"
From MaRDI portal
The following pages link to Sliding Window Abstraction for Infinite Markov Chains (Q3636872):
Displaying 14 items.
- Efficient approximation of optimal control for continuous-time Markov games (Q259052) (← links)
- Lumpability abstractions of rule-based systems (Q418843) (← links)
- Three-valued abstraction for probabilistic systems (Q444484) (← links)
- Approximation of event probabilities in noisy cellular processes (Q533357) (← links)
- A linear process-algebraic format with data for probabilistic automata (Q764285) (← links)
- Abstraction-guided truncations for stationary distributions of Markov population models (Q832087) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- Analysis of Markov jump processes under terminal constraints (Q2044200) (← links)
- Abstraction-based segmental simulation of chemical reaction networks (Q2112140) (← links)
- Coarse-graining the dynamics of ideal branched polymers (Q2520630) (← links)
- Analyzing Oscillatory Behavior with Formal Methods (Q2937728) (← links)
- On Abstraction of Probabilistic Systems (Q2937733) (← links)
- Quantitative Analysis of Communication Scenarios (Q2945583) (← links)
- Process calculi for biological processes (Q6062000) (← links)
