Image de couverture de livre

On the Separability Problem of VASS Reachability Languages

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Keskin, Eren, Meyer, Roland
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Reachability in VASS Extended with Integer Counters
par: Bizière, Clotilde, et autres
Publié: (2026)

Reachability in symmetric VASS
par: Kamiński, Łukasz, et autres
Publié: (2025)

PVASS Reachability is Decidable
par: Guttenberg, Roland, et autres
Publié: (2025)

Separability and Non-Determinizability of WSTS
par: Czerwiński, Wojciech, et autres
Publié: (2023)

On the Reachability Problem for Two-Dimensional Branching VASS
par: Bizière, Clotilde, et autres
Publié: (2025)

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
par: Baumann, Pascal, et autres
Publié: (2024)

Reachability in 3-VASS is Elementary
par: Czerwiński, Wojciech, et autres
Publié: (2025)

Improved Algorithm for Reachability in $d$-VASS
par: Fu, Yuxi, et autres
Publié: (2024)

Efficient Analysis of Polynomial Asymptotic Estimates for VASS MDPs
par: Ajdarów, Michal
Publié: (2025)

Reachability in Geometrically $d$-Dimensional VASS
par: Fu, Yuxi, et autres
Publié: (2025)

Exploring VASS Parameterised by Geometric Dimension
par: Czerwiński, Wojciech, et autres
Publié: (2026)

Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
par: Czerwiński, Wojciech, et autres
Publié: (2025)

Reachability in Trace-Pushdown Systems
par: Köcher, Chris, et autres
Publié: (2025)

Completely Reachable Almost Group Automata
par: Torres, David Fernando Casas
Publié: (2024)

Box-Reachability in Vector Addition Systems
par: Almagor, Shaull, et autres
Publié: (2025)

Continuous Pushdown VASS in One Dimension are Easy
par: Perez, Guillermo A., et autres
Publié: (2024)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
par: Bizière, Clotilde, et autres
Publié: (2024)

On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
par: Dahlsen-Jensen, Mikael Bisgaard, et autres
Publié: (2024)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
par: Gómez-Martínez, Elena, et autres
Publié: (2026)

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
par: Manini, Andrea, et autres
Publié: (2026)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
par: Jeppson, Joshua, et autres
Publié: (2025)

On Normality and Equidistribution for Separator Enumerators
par: Pulari, Subin
Publié: (2026)

A Sharper Upper Bound for the Separating Words Problem
par: Dumitru, Bogdan C.
Publié: (2025)

Exact Separation of Words via Trace Geometry
par: Chen, Zeyu, et autres
Publié: (2026)

The Expansion Problem for Infinite Trees
par: Blumensath, Achim
Publié: (2023)

Approximate Problems for Finite Transducers
par: Filiot, Emmanuel, et autres
Publié: (2025)

Saturation Problems for Families of Automata
par: Bohn, León, et autres
Publié: (2025)

Reachability Analysis of the Domain Name System
par: Nevatia, Dhruv, et autres
Publié: (2024)

The Similarity Control Problem with Required Events
par: Wang, Yu, et autres
Publié: (2026)

Algebraic Closure of Matrix Sets Recognized by 1-VASS
par: Manssour, Rida Ait El, et autres
Publié: (2025)

Resynchronized Uniformization and Definability Problems for Rational Relations
par: Löding, Christof, et autres
Publié: (2021)

Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
par: Principato, Flavio T., et autres
Publié: (2025)

Computing the Reachability Value of Posterior-Deterministic POMDPs
par: Fijalkow, Nathanaël, et autres
Publié: (2026)

Uniform Membership for Hyperedge Replacement Grammars and Related Decision Problems
par: Pshenitsyn, Tikhon
Publié: (2025)

Fine-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs
par: Drabik, Karolina, et autres
Publié: (2025)

Minimum Reachability Probabilities in Rectangular Automata with Random Clocks
par: Delicaris, Joanna, et autres
Publié: (2026)

Learning EFSM Models with Registers in Guards
par: Vega, Germán, et autres
Publié: (2024)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
par: Prinz, Thomas M., et autres
Publié: (2026)

Active Inference of Extended Finite State Machine Models with Registers and Guards
par: Groz, Roland, et autres
Publié: (2026)

Universally Wheeler Languages
par: Becker, Ruben, et autres
Publié: (2025)