Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: 10.1007/978-3-031-57249-4_12
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2024
- Creator
- DOI
-
10.18154/RWTH-2024-07263
- URN
-
urn:nbn:de:101:1-2408140137289.747801469680
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:50 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Mertens, Hannah
- Katoen, Joost-Pieter
- Quatmann, Tim
- Winkler, Tobias
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2024
Other Objects (12)
Monotonicity in Markov models
Under-Approximating Expected Total Rewards in POMDPs
Finding Provably Optimal Markov Chains
Verification of multi-objective Markov models
Concepts, algorithms, and tools for model checking
Boolean-logic driven Markov processes : Explained. Analysed. Verified.
Parameter synthesis in Markov models
Shepherding Hordes of Markov Chains
Gradient descent on parametric Markov Chains
A Calculus for Amortized Expected Runtimes
On the Complexity of Reachability in Parametric Markov Decision Processes
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Monotonicity in Markov models
Under-Approximating Expected Total Rewards in POMDPs
Finding Provably Optimal Markov Chains
Verification of multi-objective Markov models
Concepts, algorithms, and tools for model checking
Boolean-logic driven Markov processes : Explained. Analysed. Verified.
Parameter synthesis in Markov models
Shepherding Hordes of Markov Chains
Gradient descent on parametric Markov Chains
A Calculus for Amortized Expected Runtimes
On the Complexity of Reachability in Parametric Markov Decision Processes
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Monotonicity in Markov models
Under-Approximating Expected Total Rewards in POMDPs
Finding Provably Optimal Markov Chains
Verification of multi-objective Markov models
Concepts, algorithms, and tools for model checking
Boolean-logic driven Markov processes : Explained. Analysed. Verified.
Parameter synthesis in Markov models
Shepherding Hordes of Markov Chains
Gradient descent on parametric Markov Chains
A Calculus for Amortized Expected Runtimes
On the Complexity of Reachability in Parametric Markov Decision Processes