From

Institution

Field

Type

Open access only Cited by patents (Lens) Include non-Aachen papers (citing/cited)

Reset

Papers matching “probabilistic systems” 154

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

Not finding it? Sign in to also search OpenAlex live.

Counterexample-guided inductive synthesis for probabilistic systems
2021 Formal Aspects of Computing article Computer Science Formal Methods in Verification Open access

Milan Češka, Christian Hensel, Sebastian Junges, Joost-Pieter Katoen

7

citations
\nTowards Using Probabilistic Models to Design Software Systems with Inherent Uncertainty
2020 Radboud Repository (Radboud University) conference-paper Computer Science Advanced Software Engineering Methodologies

Alex Serban, Erik Poll, Joost Visser

7

citations
Towards Using Probabilistic Models to Design Software Systems with Inherent Uncertainty
2020 Lecture notes in computer science conference-paper Computer Science Advanced Software Engineering Methodologies Open access

Alex Serban, Erik Poll, Joost Visser

0

citations
Verifying Probabilistic Programs
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Petri Nets in System Modeling Open access

Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja

0

citations
Numerical Errors in Quantitative System Analysis With Decision Diagrams
2025 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification

Sebastiaan Brand, Arend-Jan Quist, Richard M. K. van Dijk, Alfons Laarman

2

citations
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
2023 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Tobias Winkler, Joost-Pieter Katoen

6

citations
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Formal Methods in Verification Open access

Tobias Winkler, Joost-Pieter Katoen

1

citations
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
2024 Proceedings of the ACM on Programming Languages article Computer Science Logic, programming, and type systems Open access

Lutz Klinkenberg, Mingshuai Chen, Darion Haase, Joost-Pieter Katoen

11

citations
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Lutz Klinkenberg, Mingshuai Chen

1

citations
Black-Box Testing Liveness Properties of Partially Observable Stochastic Systems
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Formal Methods in Verification Open access

Javier Esparza, Vincent P. Grande

0

citations
Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Verification of Robust Multi-Agent Systems
2026 conference-paper Computer Science Formal Methods in Verification Open access

Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano

0

citations
Latticed k-Induction with an Application to Probabilistic Programs
2021 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Kevin Batz, Mingshuai Chen, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja, Philipp Schröer

21

citations
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
2024 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Florian Frohn, Jürgen Giesl

2

citations
The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
2024 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata
2023 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Formal Methods in Verification

Joost-Pieter Katoen

5

citations
Natural Strategic Ability in Stochastic Multi-Agent Systems
2024 Proceedings of the AAAI Conference on Artificial Intelligence conference-paper Computer Science Logic, Reasoning, and Knowledge Open access

Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano

1

citations
On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Formal Methods in Verification Open access

Joost-Pieter Katoen

0

citations
Natural Strategic Ability in Stochastic Multi-Agent Systems
2024 arXiv (Cornell University) preprint Computer Science Logic, Reasoning, and Knowledge Open access

Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann, Aniello Murano

0

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 Lecture notes in computer science conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

7

citations
Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
2025 International Symposium on Principles and Practice of Declarative Programming (PPDP) conference-paper Computer Science Logic, programming, and type systems Open access

1

citations
Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
2023 RWTH Publications (RWTH Aachen) conference-paper Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

1

citations
Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)
2023 arXiv (Cornell University) preprint Computer Science Logic, programming, and type systems Open access

Jan-Christoph Kassing, Jürgen Giesl

0

citations
Model-based reinforcement learning for hydraulic systems: a PILCO-based control strategy for controlling an inverted hydraulic pendulum
2025 International Journal of Dynamics and Control article Computer Science Reinforcement Learning in Robotics Open access

Faras Brumand‐Poor, Paul Wagemann, Timm Geibel, Katharina Schmitz

4

citations
Combining Deep Learning and Physical Models: A Benchmark Study on All‐Sky Imager‐Based Solar Nowcasting Systems
2023 Solar RRL article Computer Science Solar Radiation and Photovoltaics Open access

Yann Fabel, Bijan Nouri, Stefan Wilbert, Niklas Benedikt Blum, Dominik Schnaus, Rudolph Triebel, +4 more

20

citations