Artifact for Paper: Multi-Cost-Bounded Reachability Analysis of POMDPs
Fuente:
Zenodo
Saved in:
| Main Authors: | Bork, Alexander, Katoen, Joost-Pieter, Quatmann, Tim, Stein, Svenja |
|---|---|
| Format: | Recurso digital |
| Published: |
Zenodo
2025
|
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Compositional Reasoning for Parametric Probabilistic Automata
by: Mertens, Hannah, et al.
Published: (2025)
by: Mertens, Hannah, et al.
Published: (2025)
Compositional Reasoning for Probabilistic Automata with Uncertainty
by: Mertens, Hannah, et al.
Published: (2026)
by: Mertens, Hannah, et al.
Published: (2026)
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
by: Mertens, Hannah, et al.
Published: (2024)
by: Mertens, Hannah, et al.
Published: (2024)
Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
by: Heck, Linus, et al.
Published: (2025)
by: Heck, Linus, et al.
Published: (2025)
Probabilistic Model Checking Taken by Storm
by: Volk, Matthias, et al.
Published: (2026)
by: Volk, Matthias, et al.
Published: (2026)
A Spectrum of Approximate Probabilistic Bisimulations
by: Spork, Timm, et al.
Published: (2024)
by: Spork, Timm, et al.
Published: (2024)
Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
by: Berthon, Raphaël, et al.
Published: (2024)
by: Berthon, Raphaël, et al.
Published: (2024)
Highly Incremental: A Simple Programmatic Approach for Many Objectives (Extended Version)
by: Schröer, Philipp, et al.
Published: (2026)
by: Schröer, Philipp, et al.
Published: (2026)
Unknown Biases and Timing Constraints in Timed Automata
by: Haase, Darion, et al.
Published: (2024)
by: Haase, Darion, et al.
Published: (2024)
Verification of Robust Multi-Agent Systems
by: Berthon, Raphaël, et al.
Published: (2026)
by: Berthon, Raphaël, et al.
Published: (2026)
Natural Strategic Ability in Stochastic Multi-Agent Systems
by: Berthon, Raphaël, et al.
Published: (2024)
by: Berthon, Raphaël, et al.
Published: (2024)
A Direct Reduction from Stochastic Parity Games to Simple Stochastic Games
by: Berthon, Raphaël, et al.
Published: (2025)
by: Berthon, Raphaël, et al.
Published: (2025)
Bayesian Inference in Quantum Programs
by: Gehnen, Christina, et al.
Published: (2025)
by: Gehnen, Christina, et al.
Published: (2025)
Error Localization, Certificates, and Hints for Probabilistic Program Verification via Slicing (Extended Version)
by: Schröer, Philipp, et al.
Published: (2025)
by: Schröer, Philipp, et al.
Published: (2025)
Quantifier Elimination and Craig Interpolation, Quantitatively
by: Batz, Kevin, et al.
Published: (2025)
by: Batz, Kevin, et al.
Published: (2025)
Verifying Concurrent Stacks by Divergence-Sensitive Bisimulation
by: Yang, Xiaoxiao, et al.
Published: (2017)
by: Yang, Xiaoxiao, et al.
Published: (2017)
Model Checking Temporal Properties of Recursive Probabilistic Programs
by: Winkler, Tobias, et al.
Published: (2021)
by: Winkler, Tobias, et al.
Published: (2021)
Towards Concurrent Quantitative Separation Logic
by: Fesefeldt, Ira, et al.
Published: (2022)
by: Fesefeldt, Ira, et al.
Published: (2022)
Fixed Point Certificates for Reachability and Expected Rewards in MDPs
by: Chatterjee, Krishnendu, et al.
Published: (2025)
by: Chatterjee, Krishnendu, et al.
Published: (2025)
Foundations for Deductive Verification of Continuous Probabilistic Programs: From Lebesgue to Riemann and Back
by: Batz, Kevin, et al.
Published: (2025)
by: Batz, Kevin, et al.
Published: (2025)
Verifying Sampling Algorithms via Distributional Invariants
by: Zilken, Daniel, et al.
Published: (2025)
by: Zilken, Daniel, et al.
Published: (2025)
Computing the Reachability Value of Posterior-Deterministic POMDPs
by: Fijalkow, Nathanaël, et al.
Published: (2026)
by: Fijalkow, Nathanaël, et al.
Published: (2026)
Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems
by: Ahrens, Emma, et al.
Published: (2025)
by: Ahrens, Emma, et al.
Published: (2025)
Approximate Probabilistic Bisimulation for Continuous-Time Markov Chains
by: Spork, Timm, et al.
Published: (2025)
by: Spork, Timm, et al.
Published: (2025)
Exact Bayesian Inference for Loopy Probabilistic Programs using Generating Functions
by: Klinkenberg, Lutz, et al.
Published: (2023)
by: Klinkenberg, Lutz, et al.
Published: (2023)
Sound Heuristic Search Value Iteration for Undiscounted POMDPs with Reachability Objectives
by: Ho, Qi Heng, et al.
Published: (2024)
by: Ho, Qi Heng, et al.
Published: (2024)
Generating Functions Meet Occupation Measures: Invariant Synthesis for Probabilistic Loops (Extended Version)
by: Haase, Darion, et al.
Published: (2026)
by: Haase, Darion, et al.
Published: (2026)
Adversarial Robustness of Time-Series Classification for Crystal Collimator Alignment
by: Fink, Xaver, et al.
Published: (2026)
by: Fink, Xaver, et al.
Published: (2026)
Caesar: A Deductive Verifier for Probabilistic Programs
by: Schröer, Philipp, et al.
Published: (2026)
by: Schröer, Philipp, et al.
Published: (2026)
Multi-stage Deep Learning Artifact Reduction for Pallel-beam Computed Tomography
by: Shi, Jiayang, et al.
Published: (2023)
by: Shi, Jiayang, et al.
Published: (2023)
Multi-Environment POMDPs with Finite-Horizon Objectives
by: Brice, Léonard, et al.
Published: (2026)
by: Brice, Léonard, et al.
Published: (2026)
Refined Bounds on Near Optimality Finite Window Policies in POMDPs and Their Reinforcement Learning
by: Demirci, Yunus Emre, et al.
Published: (2024)
by: Demirci, Yunus Emre, et al.
Published: (2024)
Provable Bounds on the Hessian of Neural Networks: Derivative-Preserving Reachability Analysis
by: Sharifi, Sina, et al.
Published: (2024)
by: Sharifi, Sina, et al.
Published: (2024)
Artifact of OOPSLA 2025 Paper 341
by: anonymity
Published: (2025)
by: anonymity
Published: (2025)
Certified Approximate Reachability (CARe): Formal Error Bounds on Deep Learning of Reachable Sets
by: Solanki, Prashant, et al.
Published: (2025)
by: Solanki, Prashant, et al.
Published: (2025)
ISC-POMDPs: Partially Observed Markov Decision Processes with Initial-State Dependent Costs
by: Molloy, Timothy L.
Published: (2025)
by: Molloy, Timothy L.
Published: (2025)
Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
by: Asadi, Ali, et al.
Published: (2025)
by: Asadi, Ali, et al.
Published: (2025)
Trawl records of krill (Meganyctiphanes norvegica) and glass shrimps (Pasiphaea sp.) in the inner Oslofjord between February 2020 and April 2023
by: Christiansen, Svenja, et al.
Published: (2024)
by: Christiansen, Svenja, et al.
Published: (2024)
A Cegar-centric Bounded Reachability Analysis for Compositional Affine Hybrid Systems
by: Kundu, Atanu, et al.
Published: (2025)
by: Kundu, Atanu, et al.
Published: (2025)
Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
by: Češka, Milan, et al.
Published: (2026)
by: Češka, Milan, et al.
Published: (2026)
Similar Items
-
Compositional Reasoning for Parametric Probabilistic Automata
by: Mertens, Hannah, et al.
Published: (2025) -
Compositional Reasoning for Probabilistic Automata with Uncertainty
by: Mertens, Hannah, et al.
Published: (2026) -
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
by: Mertens, Hannah, et al.
Published: (2024) -
Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
by: Heck, Linus, et al.
Published: (2025) -
Probabilistic Model Checking Taken by Storm
by: Volk, Matthias, et al.
Published: (2026)