- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Bachelorarbeit, 2020
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2020
- Urheber
-
Heck, Linus
- Beteiligte Personen und Organisationen
- DOI
-
10.18154/RWTH-2020-10391
- URN
-
urn:nbn:de:101:1-2021021702373090681191
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:43 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
- Heck, Linus
- Katoen, Joost-Pieter
- Noll, Thomas
- Spel, Jip Josephine
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2020
Ähnliche Objekte (12)
On the Complexity of Reachability in Parametric Markov Decision Processes
Monotonicity in Markov models
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
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
Automatically Finding the Right Probabilities in Bayesian Networks
On the Complexity of Reachability in Parametric Markov Decision Processes
Monotonicity in Markov models
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
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
Automatically Finding the Right Probabilities in Bayesian Networks
On the Complexity of Reachability in Parametric Markov Decision Processes
Monotonicity in Markov models
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
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration