Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: 10.1007/978-3-031-57249-4_12
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2024
- Urheber
- DOI
-
10.18154/RWTH-2024-07263
- URN
-
urn:nbn:de:101:1-2408140137289.747801469680
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:50 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Mertens, Hannah
- Katoen, Joost-Pieter
- Quatmann, Tim
- Winkler, Tobias
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2024
Ähnliche Objekte (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