| 2025 |
| DOI | Carolina Gerlach, Tobias Winkler, Erika Ábrahám, Borzoo Bonakdarpour, Sebastian Junges.
Efficient Probabilistic Model Checking for Relational Reachability,
Volume 15931 of LNCS, pages 127-147, Springer, 2025. |
| DOIFull Text | Lutz Klinkenberg.
Analysis of probabilistic programs using generating functions,
RWTH Aachen University, 2025. |
| DOIFull Text | Raphael Jean Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano.
Robust Strategies for Stochastic Multi-Agent Systems,
pages 2437-2439, International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), 2025. |
| Elbeck Lazaridi.
Implementing the denotational semantics of probabilistic programs,
2025. |
| DOIFull Text | Alexander Nikolai Bork, Tim Quatmann, Joost-Pieter Katoen, Svenja Maria Stein.
Multi-Cost-Bounded Reachability Analysis of POMDPs,
Volume 286 of Proceedings of machine learning research, pages 354-366, 2025. |
| DOIFull Text | Kaleb Kierner.
Modeling non-deterministic quantum programs for model checking,
RWTH Aachen University, 2025. |
| DOIFull Text | Marcel Eissing.
On the relation of rely-guarantee and assume-guarantee reasoning,
RWTH Aachen University, 2025. |
| DOIFull Text | Timm Spork, Christel Baier, Joost-Pieter Katoen, Sascha Klüppelholz, Jakob Piribauer.
Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains,
Volume 15932 of LNCS, pages 56-81, Springer, 2025. |
| Johannes Peter Valentin Gaidetzka.
Quantum circuit optimization through eliminating and deferring mid-circuit measurements,
2025. |
| Glen Jordan Grant.
Exploration of certificate sharing for neural network verification,
2025. |
| Sophia Greiwe.
Implementation of PRNG-based elimination of intermediate measurements in quantum circuits,
2025. |
| DOIFull Text | Mareike Metzler.
Evaluating tool support for fault tree analysis of satellite constellations,
RWTH Aachen University, 2025. |
| Dobromir Panayotov.
Scalable qubit routing on the conveyor-based SpinBus architecture,
2025. |
| Rico Stanosek.
Cost-reliability optimal spare part allocation in dynamic fault trees with relaxed spare gates,
2025. |
| Sascha Thiemann.
Compilation of quantum programs with control flow primitives in superposition,
2025. |
| DOIFull Text | Hannah Mertens, Tim Quatmann, Joost-Pieter Katoen.
Compositional Reasoning for Parametric Probabilistic Automata,
Volume 348 of Leibniz international proceedings in informatics, pages 31:1-31:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 2025. |
| DOIFull Text | Raphael Jean Berthon, Joost-Pieter Katoen, Zihan Zhou.
A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games,
Volume 348 of Leibniz international proceedings in informatics, pages 9:1-9:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, 2025. |
| Muhammad Asad Murtaza Butt.
Extending the assume–guarantee framework for parametric probabilistic automata,
2025. |
| DOIFull Text | Dominic Sebastian Meiser.
Multi‐agent path finding for reversible conveyors,
RWTH Aachen University, 2025. |
| DOIFull Text | Emma Katharina Ahrens, Jan-Christoph Kassing, Jürgen Giesl, Joost-Pieter Katoen.
Weighted Rewriting,
Volume 337 of Leibniz international proceedings in informatics, pages 6:1-6:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing, 2025. |
| DOIFull Text | Philipp Schroer, Darion Haase, Joost-Pieter Katoen.
Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing (Extended Version),
2025. |
| 2024 |
| DOIFull Text | Alexander Ferber.
Combining integer programs and graph grammars,
RWTH Aachen University, 2024. |
| DOIFull Text | Kevin Batz, Tom Jannik Biskup, Joost-Pieter Katoen, Tobias Winkler.
Programmatic Strategy Synthesis,
pages 93, ACM, 2024. |
| DOIFull Text | Tobias Winkler.
Complexity and decidability of multi-objective stochastic games,
RWTH Aachen University, 2024. |
| DOIFull Text | Tom Biskup.
Invariant-based strategy synthesis for nondeterministic probabilistic programs,
RWTH Aachen University, 2024. |