Cover Image

Compositional Verification of Almost-Sure Büchi Objectives in MDPs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	van der Vegt, Marck, Watanabe, Kazuki, Hasuo, Ichiro, Junges, Sebastian
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs
by: Suilen, Marnix, et al.
Published: (2024)

Robust Almost-Sure Reachability in Multi-Environment MDPs
by: van der Vegt, Marck, et al.
Published: (2023)

Pareto Curves for Compositionally Model Checking String Diagrams of MDPs
by: Watanabe, Kazuki, et al.
Published: (2024)

Compositional Value Iteration with Pareto Caching
by: Watanabe, Kazuki, et al.
Published: (2024)

A Unifying Approach to Product Constructions for Quantitative Temporal Inference
by: Watanabe, Kazuki, et al.
Published: (2024)

Strategy Templates for Almost-Sure and Positive Winning of Stochastic Parity Games towards Permissive and Resilient Control
by: Phalakarn, Kittiphon, et al.
Published: (2024)

Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families
by: Češka, Milan, et al.
Published: (2026)

Tractable Hyperproperties for MDPs
by: Gerlach, Lina, et al.
Published: (2026)

Small Decision Trees for MDPs with Deductive Synthesis
by: Andriushchenko, Roman, et al.
Published: (2025)

Policies Grow on Trees: Model Checking Families of MDPs
by: Andriushchenko, Roman, et al.
Published: (2024)

Shields to Guarantee Probabilistic Safety in MDPs
by: Heck, Linus, et al.
Published: (2026)

Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
by: Doyen, Laurent, et al.
Published: (2026)

Widest Path Games and Maximality Inheritance in Bounded Value Iteration for Stochastic Games
by: Phalakarn, Kittiphon, et al.
Published: (2025)

Positive Almost-Sure Termination of Polynomial Random Walks
by: Winkler, Lorenz, et al.
Published: (2025)

Almost-Sure Termination by Guarded Refinement
by: Gregersen, Simon Oddershede, et al.
Published: (2024)

Pareto Fronts for Compositionally Solving String Diagrams of Parity Games
by: Watanabe, Kazuki
Published: (2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Almost Surely Asymptotically Constant Graph Neural Networks
by: Adam-Day, Sam, et al.
Published: (2024)

Learning Robust Markov Models for Safe Runtime Monitoring
by: Skurka, Antonina, et al.
Published: (2026)

Learning Verified Monitors for Hidden Markov Models
by: van der Maas, Luko, et al.
Published: (2025)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
by: Kassing, Jan-Christoph, et al.
Published: (2026)

The Value Problem for Multiple-Environment MDPs with Parity Objective
by: Chatterjee, Krishnendu, et al.
Published: (2025)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Omega-regular Verification and Control for Distributional Specifications in MDPs
by: Akshay, S., et al.
Published: (2025)

Half-Positional Objectives Recognized by Deterministic Büchi Automata
by: Bouyer, Patricia, et al.
Published: (2022)

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2025)

Monads and Distributive Laws in Substructural Contexts (Extended Version)
by: Fujii, Soichiro, et al.
Published: (2026)

Hybrid Spatiotemporal Logic for Automotive Applications: Modeling and Model-Checking
by: Tulcan, Radu-Florin, et al.
Published: (2026)

A Denotational Product Construction for Temporal Verification of Effectful Higher-Order Programs
by: Watanabe, Kazuki, et al.
Published: (2025)

Small Test Suites for Active Automata Learning
by: Kruger, Loes, et al.
Published: (2024)

Relating Apartness and Branching Bisimulation Games
by: Rot, Jurriaan, et al.
Published: (2024)

Semiring Provenance for Büchi Games: Strategy Analysis with Absorptive Polynomials
by: Grädel, Erich, et al.
Published: (2021)

A No-go Theorem for Coalgebraic Product Construction
by: Kori, Mayuko, et al.
Published: (2025)

From Coalgebraic Determinization to Belief Construction for Partial Observability
by: Kori, Mayuko, et al.
Published: (2026)

A PAC Learning Algorithm for LTL and Omega-regular Objectives in MDPs
by: Perez, Mateo, et al.
Published: (2023)

Solving MDPs with LTLf+ and PPLTL+ Temporal Objectives
by: De Giacomo, Giuseppe, et al.
Published: (2025)

Certified Policy Verification and Synthesis for MDPs under Distributional Reach-avoidance Properties
by: Akshay, S., et al.
Published: (2024)