Parameter Synthesis Algorithms for Parametric Interval Markov Chains
DOI10.1007/978-3-319-92612-4_7OpenAlexW2806784953WikidataQ62047440 ScholiaQ62047440MaRDI QIDQ5881537
Laure Petrucci, Jaco van de Pol
Publication date: 10 March 2023
Published in: Formal Techniques for Distributed Objects, Components, and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-92612-4_7
constraint logic programmingbackward algorithminterval Markov chainslongest simple pathparameter synthesis problem
Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Abstract probabilistic automata
- Parametric probabilistic transition systems for system design and analysis
- Model checking of open interval Markov chains
- Reachability in parametric interval Markov chains using constraints
- On the complexity of model checking interval-valued discrete time Markov chains
- Parameter synthesis for Markov models: faster than ever
- Parameter Synthesis for Parametric Interval Markov Chains
- Theoretical Aspects of Computing - ICTAC 2004
This page was built for publication: Parameter Synthesis Algorithms for Parametric Interval Markov Chains