- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Bachelorarbeit, 2024
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2024
- Urheber
-
Vitorino, Dinis
Winkler, Tobias
- Beteiligte Personen und Organisationen
- DOI
-
10.18154/RWTH-2024-06746
- URN
-
urn:nbn:de:101:1-2407210133172.006888239128
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:52 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
- Vitorino, Dinis
- Winkler, Tobias
- Katoen, Joost-Pieter
- Noll, Thomas
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2024
Ähnliche Objekte (12)
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Automata-based model checking of recursive systems
Compositional control-flow reduction for probabilistic model checking
Learning probabilistic automata with SMT solving
Synthesizing FDIR recovery strategies for space systems
Quantitative Analysis of Counterexample Generation for Automata Learning
Proving termination of pointer programs on top of symbolic execution
Model checking pPDA vs unambiguous automata
Pushdown and expectation transformer semantics of probabilistic recursive programs with nested conditioning
Combining integer programs and graph grammars: Theory and implementation in Attestor
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Automata-based model checking of recursive systems
Compositional control-flow reduction for probabilistic model checking
Learning probabilistic automata with SMT solving
Synthesizing FDIR recovery strategies for space systems
Quantitative Analysis of Counterexample Generation for Automata Learning
Proving termination of pointer programs on top of symbolic execution
Model checking pPDA vs unambiguous automata
Pushdown and expectation transformer semantics of probabilistic recursive programs with nested conditioning
Combining integer programs and graph grammars: Theory and implementation in Attestor
Invariant-based strategy synthesis for nondeterministic probabilistic programs
Towards Concurrent Quantitative Separation Logic
Towards Concurrent Quantitative Separation Logic
Automata-based model checking of recursive systems
Compositional control-flow reduction for probabilistic model checking
Learning probabilistic automata with SMT solving
Synthesizing FDIR recovery strategies for space systems
Quantitative Analysis of Counterexample Generation for Automata Learning
Proving termination of pointer programs on top of symbolic execution
Model checking pPDA vs unambiguous automata
Pushdown and expectation transformer semantics of probabilistic recursive programs with nested conditioning