Cover Image

Positive Almost-Sure Termination of Polynomial Random Walks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Winkler, Lorenz, Kovács, Laura
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

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

Almost-Sure Termination by Guarded Refinement
by: Gregersen, Simon Oddershede, et al.
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)

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

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

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

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

Compositional Verification of Almost-Sure Büchi Objectives in MDPs
by: van der Vegt, Marck, et al.
Published: (2025)

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

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

Almost Surely Asymptotically Constant Graph Neural Networks
by: Adam-Day, Sam, 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)

Termination of Triangular Polynomial Loops
by: Hark, Marcel, et al.
Published: (2019)

Chase Termination Beyond Polynomial Time
by: Hanisch, Philipp, et al.
Published: (2024)

Deciding Termination of Simple Randomized Loops
by: Meyer, Éléanore, et al.
Published: (2025)

Terminating Hybrid Tableaus for Ordered Models
by: Nishimura, Yuki
Published: (2025)

Complete and Terminating Tableau Calculus for Undirected Graph
by: Nishimura, Yuki, et al.
Published: (2024)

Lazy Reimplication in Chronological Backtracking
by: Coutelier, Robin, et al.
Published: (2025)

Partial Redundancy in Saturation
by: Hajdu, Márton, et al.
Published: (2025)

Rewriting and Inductive Reasoning
by: Hajdu, Márton, et al.
Published: (2024)

Finding Connections via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2026)

Constraint Learning for Non-confluent Proof Search
by: Rawson, Michael, et al.
Published: (2026)

Spanning Matrices via Satisfiability Solving
by: Eisenhofer, Clemens, et al.
Published: (2024)

First-Order LTLf Synthesis with Lookback (Extended Version)
by: Winkler, Sarah
Published: (2025)

Certificate-Aware Property-Directed Reachability
by: Ferdowsi, Arman, et al.
Published: (2026)

Term Ordering Diagrams
by: Hajdu, Márton, et al.
Published: (2025)

On Solving String Equations via Powers and Parikh Images
by: Eisenhofer, Clemens, et al.
Published: (2026)

Program Synthesis in Saturation
by: Hozzová, Petra, et al.
Published: (2024)

SAT-Based Subsumption Resolution
by: Coutelier, Robin, et al.
Published: (2024)

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
by: Pinsker, Michael, et al.
Published: (2025)

Saturating Sorting without Sorts
by: Georgiou, Pamina, et al.
Published: (2024)

Completeness of Synthesis under Realizability Assumptions using Superposition
by: Hajdu, Márton, et al.
Published: (2026)

Hydra Battles and AC Termination
by: Hirokawa, Nao, et al.
Published: (2023)

Functional variant of Polynomial Analogue of Gandy's Fixed Point Theorem
by: Nechesov, Andrey
Published: (2024)

Getting Saturated with Induction
by: Hajdu, Márton, et al.
Published: (2024)

SAT Solving for Variants of First-Order Subsumption
by: Coutelier, Robin, et al.
Published: (2024)

PolySAT: Word-level Bit-vector Reasoning in Z3
by: Rath, Jakob, et al.
Published: (2024)

Lean on Vampire Proofs (Short Paper)
by: Bodingbauer, Jonas, et al.
Published: (2026)