Cover Image

Reachability in VASS Extended with Integer Counters

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bizière, Clotilde, Czerwiński, Wojciech, Guttenberg, Roland, Leroux, Jérôme, Michielini, Vincent, Orlikowski, Łukasz, Puch, Antoni, Sinclair-Banks, Henry
Format:	Preprint
Published:	2026
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

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

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

Reachability in 3-VASS is Elementary
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)

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

Languages of Boundedly-Ambiguous Vector Addition Systems with States
by: Czerwiński, Wojciech, et al.
Published: (2025)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
by: Chistikov, Dmitry, et al.
Published: (2024)

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

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

Invariants for One-Counter Automata with Disequality Tests
by: Chistikov, Dmitry, et al.
Published: (2024)

Reachability and Related Problems in Vector Addition Systems with Nested Zero Tests
by: Guttenberg, Roland, et al.
Published: (2025)

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

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

PVASS Reachability is Decidable
by: Guttenberg, Roland, et al.
Published: (2025)

Flattability of Priority Vector Addition Systems
by: Guttenberg, Roland
Published: (2024)

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

History-Constrained Systems
by: Kuijer, Louwe B., et al.
Published: (2026)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
by: Shakiba, Yousef, et al.
Published: (2025)

Efficient Analysis of Polynomial Asymptotic Estimates for VASS MDPs
by: Ajdarów, Michal
Published: (2025)

Separability and Non-Determinizability of WSTS
by: Czerwiński, Wojciech, et al.
Published: (2023)

On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2024)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
by: Czerwiński, Wojciech, et al.
Published: (2022)

TARZAN: A Region-Based Library for Forward and Backward Reachability of Timed Automata (Extended Version)
by: Manini, Andrea, et al.
Published: (2026)

Reachability in Trace-Pushdown Systems
by: Köcher, Chris, et al.
Published: (2025)

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

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

Completely Reachable Almost Group Automata
by: Torres, David Fernando Casas
Published: (2024)

Global One-Counter Tree Automata
by: Herrmann, Luisa, et al.
Published: (2024)

Two-Way One-Counter Nets Revisited
by: Almagor, Shaull, et al.
Published: (2024)

Infinite-state Games with Energy Objectives Beyond Counters
by: Sağlam, Irmak, et al.
Published: (2026)

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

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
by: Eichler, Paul, et al.
Published: (2024)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
by: Leys, Tim, et al.
Published: (2024)

Active Inference of Extended Finite State Machine Models with Registers and Guards
by: Groz, Roland, et al.
Published: (2026)

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
by: Zetzsche, Stefan, et al.
Published: (2024)

On state complexity for subword-closed languages
by: Guyot, Jérôme
Published: (2024)

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

The Black Ninjas and the Sniper: On Robustness of Population Protocols
by: Lossin, Benno, et al.
Published: (2024)

Extended time Petri nets
by: Radom, Marcin, et al.
Published: (2024)

Extended Stone Duality via Monoidal Adjunctions
by: Lenke, Fabian, et al.
Published: (2024)