Cover Image

Efficient Analysis of Polynomial Asymptotic Estimates for VASS MDPs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ajdarów, Michal
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the Separability Problem of VASS Reachability Languages
by: Keskin, Eren, et al.
Published: (2024)

Reachability in VASS Extended with Integer Counters
by: Bizière, Clotilde, et al.
Published: (2026)

Reachability in symmetric VASS
by: Kamiński, Łukasz, et al.
Published: (2025)

Reachability in 3-VASS is Elementary
by: Czerwiński, Wojciech, et al.
Published: (2025)

Exploring VASS Parameterised by Geometric Dimension
by: Czerwiński, Wojciech, et al.
Published: (2026)

Improved Algorithm for Reachability in $d$-VASS
by: Fu, Yuxi, et al.
Published: (2024)

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
by: Czerwiński, Wojciech, et al.
Published: (2025)

On the Reachability Problem for Two-Dimensional Branching VASS
by: Bizière, Clotilde, et al.
Published: (2025)

Continuous Pushdown VASS in One Dimension are Easy
by: Perez, Guillermo A., et al.
Published: (2024)

Taming Infinity one Chunk at a Time: Concisely Represented Strategies in One-Counter MDPs
by: Ajdarów, Michal, et al.
Published: (2025)

Reachability in Geometrically $d$-Dimensional VASS
by: Fu, Yuxi, et al.
Published: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
by: Mazowiecki, Filip, et al.
Published: (2025)

Efficient Analysis of Unambiguous Automata Using Matrix Semigroup Techniques
by: Kiefer, Stefan, et al.
Published: (2019)

Computing measures of weak-MSO definable sets of trees
by: Niwiński, Damian, et al.
Published: (2024)

On Good-for-MDPs Automata
by: Schewe, Sven, et al.
Published: (2022)

Algebraic Closure of Matrix Sets Recognized by 1-VASS
by: Manssour, Rida Ait El, et al.
Published: (2025)

Box-Reachability in Vector Addition Systems
by: Almagor, Shaull, et al.
Published: (2025)

Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)

Efficient Learning of Weak Deterministic Büchi Automata
by: Alluwayma, Mona, et al.
Published: (2025)

Efficient Constructions of Finite-State Independent Normal Pairs
by: Pulari, Subin
Published: (2026)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)

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

TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics
by: Akshay, S., et al.
Published: (2025)

The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently
by: Lehtinen, Karoliina, et al.
Published: (2025)

A Close Analysis of the Subset Construction
by: Baburin, Ivan, et al.
Published: (2024)

Efficient Runtime Verification of Real-Time Systems under Parametric Communication Delays
by: Fränzle, Martin, et al.
Published: (2024)

Efficient Interaction-Based Offline Runtime Verification of Distributed Systems with Lifeline Removal
by: Mahe, Erwan, et al.
Published: (2024)

GrappaRE -- A Tool for Efficient Graph Recognition Based on Finite Automata and Regular Expressions
by: De Rosa, Mattia, et al.
Published: (2025)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
by: Kan, Shuanglong, et al.
Published: (2025)

Formalized Run-Time Analysis of Active Learning -- Coalgebraically in Agda
by: Wißmann, Thorsten
Published: (2026)

Static Analysis Framework for Detecting Use-After-Free Bugs in C++
by: Teodorescu, Vlad-Alexandru, et al.
Published: (2024)

Semiflows, Home Spaces, and Home States, Applications to the Analysis of Parameterized Petri Nets
by: Memmi, Gerard
Published: (2025)

Vulnerabilities Analysis and Secure Controlling for Unmanned Aerial System Based on Reactive Synthesis
by: Yang, Dong, et al.
Published: (2024)

Finite Automata Encoding Piecewise Polynomials
by: Berdinsky, Dmitry, et al.
Published: (2021)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
by: Yamakami, Tomoyuki
Published: (2023)

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
by: Haneef, Farah
Published: (2024)

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

Statistical process discovery
by: Cry, Pierre, et al.
Published: (2025)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
by: Jeppson, Joshua, et al.
Published: (2025)