Cover Image

Fixed Point Certificates for Reachability and Expected Rewards in MDPs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chatterjee, Krishnendu, Quatmann, Tim, Schäffeler, Maximilian, Weininger, Maximilian, Winkler, Tobias, Zilken, Daniel
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Discrete Mathematics Systems and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Verifying Sampling Algorithms via Distributional Invariants
by: Zilken, Daniel, et al.
Published: (2025)

Statistical Model Checking Beyond Means: Quantiles, CVaR, and the DKW Inequality (extended version)
by: Budde, Carlos E., et al.
Published: (2025)

Consistency of P-time event graphs is decidable in polynomial time (extended version)
by: Zorzenon, Davide, et al.
Published: (2023)

On Piecewise Affine Reachability with Bellman Operators
by: Varonka, Anton, et al.
Published: (2025)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
by: Lyon, Tim S.
Published: (2022)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
by: Neuen, Daniel, et al.
Published: (2026)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
by: Roberson, David E., et al.
Published: (2023)

The domino problem is decidable for robust tilesets
by: Aubrun, Nathalie, et al.
Published: (2024)

FO logic on cellular automata orbits equals MSO logic
by: Theyssier, Guillaume
Published: (2024)

Sound Value Iteration for Simple Stochastic Games
by: Azeem, Muqsit, et al.
Published: (2024)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
by: Fuchser, Janne, et al.
Published: (2025)

Logic-based analogical proportions
by: Antić, Christian
Published: (2024)

Stopping Criteria for Value Iteration on Concurrent Stochastic Reachability and Safety Games
by: Grobelna, Marta, et al.
Published: (2025)

North-East Lattice Paths Avoiding $k$ Collinear Points via Satisfiability
by: Barnoff, Aaron, et al.
Published: (2025)

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
by: Adler, Isolde, et al.
Published: (2025)

Boolean Variation and Boolean Logic BackPropagation
by: Nguyen, Van Minh
Published: (2023)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
by: Lyon, Tim S., et al.
Published: (2023)

Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical constraints
by: Callard, Antonin, et al.
Published: (2024)

Sound Statistical Model Checking for Probabilities and Expected Rewards (extended version)
by: Budde, Carlos E., et al.
Published: (2024)

Verified Certificates via SAT and Computer Algebra Systems for the Ramsey $R(3, 8)$ and $R(3, 9)$ Problems
by: Li, Zhengyu, et al.
Published: (2025)

An Algorithmic Meta Theorem for Homomorphism Indistinguishability
by: Seppelt, Tim
Published: (2024)

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
by: Seppelt, Tim
Published: (2023)

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

Separability Properties of Monadically Dependent Graph Classes
by: Bonnet, Édouard, et al.
Published: (2025)

Existential Positive Transductions of Sparse Graphs
by: Mählmann, Nikolas, et al.
Published: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

Decidability of Querying First-Order Theories via Countermodels of Finite Width
by: Feller, Thomas, et al.
Published: (2023)

Bounding the Weisfeiler-Leman Dimension via a Depth Analysis of I/R-Trees
by: Kiefer, Sandra, et al.
Published: (2024)

Learning Foundations Beneath the Stars
by: Cardone, Felice, et al.
Published: (2026)

On the Subspace Orbit Problem and the Simultaneous Skolem Problem
by: Bacik, Piotr, et al.
Published: (2026)

Home Spaces and Invariants to Analyze Parameterized Petri Nets
by: Memmi, Gerard
Published: (2024)

SAT-Solving the Poset Cover Problem
by: Yuan, Chih-Cheng Rex, et al.
Published: (2025)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
by: Haar, Stefan, et al.
Published: (2025)

Efficient reversal of transductions of sparse graph classes
by: Dreier, Jan, et al.
Published: (2026)

On the number of asynchronous attractors in AND-NOT Boolean networks
by: Trinh, Van-Giang, et al.
Published: (2025)