Abstraction and refinement of probabilistic automata using modal stochastic games
- Weitere Titel
-
Abstraktion und Verfeinerung von probabilistischen Automaten mit modalen stochastischen Spielen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Aachen, Techn. Hochsch., Dissertation, 2015
- Erschienen in
-
Aachener Informatik-Berichte ; 2015,10
- Schlagwort
-
Games
Probabilistic automata
Abstraction
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2015
- Urheber
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:hbz:82-rwth-2015-019053
- 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
- Sher, Falak
- Katoen, Joost-Pieter
- Zhang, Lijun
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2015
Ähnliche Objekte (12)
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
New results on probabilistic verification : automata, logic and satisfiability
Concepts, algorithms, and tools for model checking
Learning probabilistic automata with SMT solving
High-level Counterexamples for Probabilistic Automata
Automata-based model checking of recursive systems
Model checking pPDA vs unambiguous automata
Quantitative Analysis of Counterexample Generation for Automata Learning
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Monitoring CTMCs by Multi-clock Timed Automata
Automatically Finding the Right Probabilities in Bayesian Networks
Sound Value Iteration
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
New results on probabilistic verification : automata, logic and satisfiability
Concepts, algorithms, and tools for model checking
Learning probabilistic automata with SMT solving
High-level Counterexamples for Probabilistic Automata
Automata-based model checking of recursive systems
Model checking pPDA vs unambiguous automata
Quantitative Analysis of Counterexample Generation for Automata Learning
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Monitoring CTMCs by Multi-clock Timed Automata
Automatically Finding the Right Probabilities in Bayesian Networks
Sound Value Iteration
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
New results on probabilistic verification : automata, logic and satisfiability
Concepts, algorithms, and tools for model checking
Learning probabilistic automata with SMT solving
High-level Counterexamples for Probabilistic Automata
Automata-based model checking of recursive systems
Model checking pPDA vs unambiguous automata
Quantitative Analysis of Counterexample Generation for Automata Learning
Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications
Monitoring CTMCs by Multi-clock Timed Automata
Automatically Finding the Right Probabilities in Bayesian Networks