From

Institution

Field

Type

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

Reset

Papers matching “reachability probability” 30

Sort: Relevance Cited Newest Oldest Fwci Patents ⇩ CSV

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

Efficient Probabilistic Model Checking for Relational Reachability
2025 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Lina Gerlach, Tobias Winkler, Erika Ábrahám, Borzoo Bonakdarpour, Sebastian Junges

3

citations
The Complexity of Reachability in Parametric Markov Decision Processes
2020 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez, Tobias Winkler

10

citations
Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Joanna Delicaris, Erika Ábrahám, Anne Remke

0

citations
Artifact for: Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
2026 Zenodo (CERN European Organization for Nuclear Research) software Open access

Joanna Delicaris, Erika Ábrahám, Anne Remke

0

citations
Artifact for: Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
2026 Zenodo (CERN European Organization for Nuclear Research) software Open access

Joanna Delicaris, Erika Ábrahám, Anne Remke

0

citations
Scaling Up Reachability Analysis for Rectangular Automata with Random Clocks
2025 International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) conference-paper Computer Science Formal Methods in Verification

Jonas Stübbe, Anne Remke, Erika Ábrahám

0

citations
Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
2024 arXiv (Cornell University) preprint Computer Science AI-based Problem Solving and Planning Open access

Raphaël Berthon, Joost-Pieter Katoen, Tobias Winkler

0

citations
Maximizing Reachability Probabilities in Rectangular Automata with Random Clocks
2023 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Joanna Delicaris, Stefan Schupp, Erika Ábrahám, Anne Remke

2

citations
Approximating Values of Generalized-Reachability Stochastic Games
2020 RWTH Publications (RWTH Aachen) conference-paper Computer Science Formal Methods in Verification Open access

Pranav Ashok, Krishnendu Chatterjee, Jan Křetínský, Maximilian Weininger, Tobias Winkler

14

citations
Approximating Values of Generalized-Reachability Stochastic Games
2020 conference-paper Computer Science Formal Methods in Verification Open access

10

citations
Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains
2025 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Timm Spork, Christel Baier, Joost-Pieter Katoen, Sascha Klüppelholz, Jakob Piribauer

1

citations
Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains
2025 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Timm Spork, Christel Baier, Joost-Pieter Katoen, Sascha Klüppelholz, Jakob Piribauer

0

citations
Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
2026 arXiv (Cornell University) preprint Computer Science Bayesian Modeling and Causal Inference Open access

Milan Češka, Sebastian Junges, Luko van der Maas, Filip Macák, Tim Quatmann

1

citations
Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
2026 arXiv (Cornell University) preprint Computer Science Bayesian Modeling and Causal Inference Open access

Milan Češka, Sebastian Junges, Luko van der Maas, Filip Macák, Tim Quatmann

0

citations
Finding Provably Optimal Markov Chains
2021 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Jip Spel, Sebastian Junges, Joost-Pieter Katoen

12

citations
Computing Expected Visiting Times and Stationary Distributions in Markov Chains: Fast and Accurate
2025 Journal of Automated Reasoning article Computer Science Formal Methods in Verification Open access

Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann

3

citations
Unknown Biases and Timing Constraints in Timed Automata
2024 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Darion Haase, Joost-Pieter Katoen

0

citations
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
2024 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access

Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann, Tobias Winkler

2

citations
What is the best algorithm for MDP model checking?
2025 International Journal on Software Tools for Technology Transfer article Computer Science Formal Methods in Verification Open access

Tim Quatmann

2

citations
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
2024 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann

2

citations
Bayesian Inference by Symbolic Model Checking
2020 Lecture notes in computer science conference-paper Computer Science Bayesian Modeling and Causal Inference Open access

Bahare Salmani, Joost-Pieter Katoen

10

citations
Accelerating SpMV Multiplication in Probabilistic Model Checkers Using GPUs
2021 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification

Muhammad Hannan Khan, Osman Hassan, Shahid Ali Khan

8

citations
Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
2026 Lecture notes in computer science conference-paper Open access

Milan Češka, Sebastian Junges, Luko van der Maas, Filip Macák, Tim Quatmann

0

citations
Parameter synthesis in Markov models
2020 RWTH Publications (RWTH Aachen) dissertation Computer Science Formal Methods in Verification Open access

Sebastian Junges

27

citations
Compositional Reasoning for Probabilistic Automata with Uncertainty
2026 arXiv (Cornell University) preprint Computer Science Formal Methods in Verification Open access

Hannah Mertens, Tim Quatmann, Joost-Pieter Katoen

0

citations