Abstraction and refinement of probabilistic automata using modal stochastic games
- Alternative title
-
Abstraktion und Verfeinerung von probabilistischen Automaten mit modalen stochastischen Spielen
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Aachen, Techn. Hochsch., Dissertation, 2015
- Bibliographic citation
-
Aachener Informatik-Berichte ; 2015,10
- Keyword
-
Games
Probabilistic automata
Abstraction
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2015
- Creator
- Contributor
- URN
-
urn:nbn:de:hbz:82-rwth-2015-019053
- 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
- Sher, Falak
- Katoen, Joost-Pieter
- Zhang, Lijun
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2015
Other Objects (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
Formal methods for real time and probabilistic systems : proceedings
Automatically Finding the Right Probabilities in Bayesian Networks
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
Formal methods for real time and probabilistic systems : proceedings
Automatically Finding the Right Probabilities in Bayesian Networks
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
Formal methods for real time and probabilistic systems : proceedings