Cover Image

Decidability and Complexity of Decision Problems for Affine Continuous VASS

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Balasubramanian, A. R.
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)

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

The 2-Dimensional Constraint Loop Problem is Decidable
by: Guilmant, Quentin, et al.
Published: (2024)

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

Decidability of Quantum Modal Logic
by: Tokuo, Kenji
Published: (2026)

Decidability for Sturmian words
by: Hieronymi, Philipp, et al.
Published: (2021)

Dynamic Probability Logic: Decidability & Computability
by: Chopoghloo, Somayeh, et al.
Published: (2024)

Decidability of Quasi-Dense Modal Logics
by: Ostropolski-Nalewaja, Piotr, et al.
Published: (2024)

Generalized Decidability via Brouwer Trees
by: de Jong, Tom, et al.
Published: (2026)

Deciding Equations in the Time Warp Algebra
by: van Gool, Sam, et al.
Published: (2023)

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

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

Deciding Robust Instances of an Escape Problem for Dynamical Systems in Euclidean Space
by: Neumann, Eike
Published: (2025)

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

The Complexity of Deciding Characteristic Formulae Modulo Nested Simulation (extended abstract)
by: Aceto, Luca, et al.
Published: (2025)

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
by: Artale, Alessandro, et al.
Published: (2025)

Decidability Problems for Micro-Stipula
by: Delzanno, Giorgio, et al.
Published: (2025)

The Finite Satisfiability Problem for Two-Variable, First-Order Logic with one Transitive Relation is Decidable
by: Pratt-Hartmann, Ian
Published: (2017)

Measuring Decidability as Related to Busy Beaver Numbers
by: Tandi, Gurpreet, et al.
Published: (2026)

On the Decidability of Monadic Theories of Arithmetic Predicates
by: Berthé, Valérie, et al.
Published: (2024)

On the Decidability of Presburger Arithmetic Expanded with Powers
by: Karimov, Toghrul, et al.
Published: (2024)

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

On Deciding Constant Runtime of Linear Loops
by: Frohn, Florian, et al.
Published: (2026)

Presburger Functional Synthesis: Complexity and Tractable Normal Forms
by: Akshay, S., et al.
Published: (2025)

Complexity of Verification and Synthesis of Threshold Automata
by: Balasubramanian, A. R., et al.
Published: (2020)

Decidability of MSO Reparameterization over Countable Chains
by: Rabinovich, Alexander
Published: (2026)

Craig Interpolation for Decidable First-Order Fragments
by: Cate, Balder ten, et al.
Published: (2023)

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

The Complexity of Nested Reset Counter Systems
by: Balasubramanian, A. R., et al.
Published: (2026)

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
by: Su, Wanyun, et al.
Published: (2024)

Decidability of Graph Neural Networks via Logical Characterizations
by: Benedikt, Michael, et al.
Published: (2024)

Possibilistic Computation Tree Logic: Decidability and Complete Axiomatization
by: Li, Yongming
Published: (2025)

Deciding Predicate Logical Theories of Real-Valued Functions
by: Ratschan, Stefan
Published: (2023)

Skolemization and Decidability of the Bernays-Schoenfinkel Class in Goedel Logics
by: Gamsakhurdia, Mariami, et al.
Published: (2025)

Adding Circumscription to Decidable Fragments of First-Order Logic: A Complexity Rollercoaster
by: Lutz, Carsten, et al.
Published: (2024)

On the Complexity of Robust Markov Decision Processes and Bisimulation Metrics
by: Suilen, Marnix, et al.
Published: (2026)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy
by: Balasubramanian, A. R., et al.
Published: (2020)

Deciding characteristic formulae: A journey in the branching-time spectrum
by: Aceto, Luca, et al.
Published: (2025)