Consistency for parametric interval Markov chains
From MaRDI portal
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Recommendations
Cites work
- Abstract probabilistic automata
- An analysis for proving probabilistic termination of biological systems
- Consistency and refinement for interval Markov chains
- Constraint Markov chains
- Maximizing entropy over Markov processes
- Parameterized verification of many identical probabilistic timed processes
- Parametric probabilistic transition systems for system design and analysis
- Playing with probabilities in reconfigurable broadcast networks
- Probabilistic model checking of biological systems with uncertain kinetic rates
- Theoretical Aspects of Computing - ICTAC 2004
- Variable probabilistic abstraction refinement
Cited in
(11)- Opacity for linear constraint Markov chains
- Consistency in parametric interval probabilistic timed automata
- Parameter synthesis for parametric interval Markov chains
- Consistency and refinement for interval Markov chains
- Consistency of Feature Markov Processes
- Constraint Markov chains
- Parameter Synthesis Algorithms for Parametric Interval Markov Chains
- Quantitative analysis of interval Markov chains
- Efficient sensitivity analysis for parametric robust Markov chains
- Comparing labelled Markov decision processes
- Minimising the probabilistic bisimilarity distance
This page was built for publication: Consistency for parametric interval Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5240149)
