- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Bachelorarbeit, 2021
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2021
- Urheber
-
Gehnen, Christina
Winkler, Tobias
- Beteiligte Personen und Organisationen
- DOI
-
10.18154/RWTH-2024-02598
- URN
-
urn:nbn:de:101:1-2024031001155594237182
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:43 MESZ
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
- Gehnen, Christina
- Winkler, Tobias
- Katoen, Joost-Pieter
- Noll, Thomas
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2021
Ähnliche Objekte (12)
Model checking pPDA vs unambiguous automata
Learning probabilistic automata with SMT solving
Compositional control-flow reduction for probabilistic model checking
Quantitative Analysis of Counterexample Generation for Automata Learning
Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs
Pushdown and expectation transformer semantics of probabilistic recursive programs with nested conditioning
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Synthesizing FDIR recovery strategies for space systems
Most probable explanations in Bayesian Networks via weighted programming
Proving termination of pointer programs on top of symbolic execution
Model checking pPDA vs unambiguous automata
Learning probabilistic automata with SMT solving
Compositional control-flow reduction for probabilistic model checking
Quantitative Analysis of Counterexample Generation for Automata Learning
Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs
Pushdown and expectation transformer semantics of probabilistic recursive programs with nested conditioning
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Synthesizing FDIR recovery strategies for space systems
Most probable explanations in Bayesian Networks via weighted programming
Proving termination of pointer programs on top of symbolic execution
Model checking pPDA vs unambiguous automata
Learning probabilistic automata with SMT solving
Compositional control-flow reduction for probabilistic model checking
Quantitative Analysis of Counterexample Generation for Automata Learning
Entailments in quantitative separation logic with recursive definitions: constructing cyclyc proofs
Pushdown and expectation transformer semantics of probabilistic recursive programs with nested conditioning
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Synthesizing FDIR recovery strategies for space systems
Most probable explanations in Bayesian Networks via weighted programming