| 2022 |
|---|
| Dominic Sebastian Meiser. Design and evaluation of a probabilistic pointer programming language using Monte-Carlo simulation,
2022. |
| DOI | Daniel Basgöze, Matthias Volk, Joost-Pieter Katoen, Shahid Khan, Marielle Stoelinga. BDDs Strike Back: Efficient Analysis of Static and Dynamic Fault Trees,
NASA Formal Methods : 14th International Symposium, NFM 2022, Pasadena, CA, USA, May 24–27, 2022, Proceedings / edited by Jyotirmoy V. Deshmukh, Klaus Havelund, Ivan Perez, 713-732, Springer International Publishing, 2022. |
| DOI | Emma Katharina Ahrens, Marius Bozga, Radu Iosif, Joost-Pieter Katoen. Reasoning about distributed reconfigurable systems,
145-174, ACM, 2022. |
| DOI | Nils Jansen, Sebastian Junges, Joost-Pieter Katoen. Parameter Synthesis in Markov Models: A Gentle Survey,
Principles of systems design : essays dedicated to Thomas A. Henzinger on the occasion of his 60th birthday / Jean-Francois Raskin, Krishnendu Chatterjee, Laurent Doyen, Rupak Majumdar (eds.), 407-437, Springer, 2022. |
| DOI | Matthias Volk. Dynamic fault trees: semantics, analysis and applications,
1 Online-Ressource : Illustrationen, RWTH Aachen University, 2022. |
| DOI | Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen, Laura Kovács. The probabilistic termination tool amber,
90-109, Springer Science + Business Media B.V, 2022. |
| DOI | Wiebke Lenze, Bastian Kogel, Simon Schotten, Thorsten Büker, Thomas Noll, Philipp Berger, Mario Fietze. Identification of Bottlenecks in Rail Infrastructure,
Proceedings of the Fifth International Conference on Railway Technology: Research, Development and Maintenance Edited by J. Pombo Civil-Comp Conferences. - Volume 1, 23.12, Civil-Comp Press, 2022. |
| Denis Kuksaus. Markow-Entscheidungsprozesse mit mehreren Agenten : Ein Überblick mit Fokus auf effiziente Aufgabenverteilung,
2022. |
| Jan Erik Karuc. Verifying parametric Markov models using decision diagrams,
2022. |
| DOI | Christina Gehnen. POMDP-based execution models for probabilistic programs with partial observability,
1 Online-Ressource: Illustrationen, RWTH Aachen University, 2022. |
| Jonas Seidel. Comparison of heuristics for branching in neural network verification,
75 Seiten : Illustrationen, 2022. |
| Caroline Jabs. Novelty-detection-based split selection heuristics for neural network verification,
2022. |
| Ben Sturgis. Automatic verification of loop invariants in weighted programs,
2022. |
| Christian Blumenthal. Inference in discrete probabilistic programs using probability generating functions,
2022. |
| Laura Bamberger. Implementation of an LTL model checker for probabilistic pushdown automata,
2022. |
| 2021 |
|---|
| DOI | Mingshuai Chen, Martin Fränzle, Yangjia Li, Peter N. Mosaad, Naijun Zhan. Indecision and delays are the parents of failure - taming them algorithmically by synthesizing delay-resilient control,
497-528, Springer, 2021. |
| DOI | Leonore Winterer, Sebastian Junges, Ralf Wimmer, Nils Jansen, Ufuk Topcu, Joost-Pieter Katoen, Bernd Becker. Strategy Synthesis for POMDPs in Robot Planning via Game-Based Abstractions,
1040-1054, Institute of Electrical,Electronics Engineers, 2021. |
| DOI | Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Joshua Moerman, Tobias Winkler. Generating Functions for Probabilistic Programs,
Logic-Based Program Synthesis and Transformation : 30th International Symposium, LOPSTR 2020, Bologna, Italy, September 7–9, 2020, Proceedings / edited by Maribel Fernández, 231-248, Springer International Publishing [2021.] ; Cham : Imprint: Springer [2021.], 2021. |
| DOI | . Foundations of probabilistic programming,
xiv, 568 Seiten : Illustrationen, Cambridge University Press, 2021. |
| DOI | Erika Ábrahám, James H. Davenport, Matthew England, Gereon Kremer. Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings,
100633, Elsevier Science, 2021. |
| DOI | Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler. The complexity of reachability in parametric Markov decision processes,
183-210, Elsevier, 2021. |
| DOI | Kevin Batz, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja. Relatively complete verification of probabilistic programs : an expressive language for expectation-based reasoning,
39, ACM, 2021. |
| DOI | Dario Veltri. Learning probabilistic automata with SMT solving,
71 Seiten, RWTH Aachen University, 2021. |
| DOI | Mikołaj Bojańczyk, Bartek Klin, Joshua Moerman. Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata,
16 Seiten, 2021. |
| Mengying Xue. Efficient analysis of time-bounded reachability in markov automata,
2021. |