Continuous Pushdown VASS in One Dimension are Easy
Fuente:
arXiv
Saved in:
| Main Authors: | Perez, Guillermo A., Rao, Shrisha |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Reachability in 3-VASS is Elementary
by: Czerwiński, Wojciech, et al.
Published: (2025)
by: Czerwiński, Wojciech, et al.
Published: (2025)
Improved Algorithm for Reachability in $d$-VASS
by: Fu, Yuxi, et al.
Published: (2024)
by: Fu, Yuxi, et al.
Published: (2024)
Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
by: Czerwiński, Wojciech, et al.
Published: (2025)
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)
by: Bizière, Clotilde, et al.
Published: (2025)
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
by: Guha, Shibashis, et al.
Published: (2021)
by: Guha, Shibashis, et al.
Published: (2021)
Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
by: Cadilhac, Michaël, et al.
Published: (2025)
by: Cadilhac, Michaël, et al.
Published: (2025)
Reachability in Geometrically $d$-Dimensional VASS
by: Fu, Yuxi, et al.
Published: (2025)
by: Fu, Yuxi, et al.
Published: (2025)
Algebraic Closure of Matrix Sets Recognized by 1-VASS
by: Manssour, Rida Ait El, et al.
Published: (2025)
by: Manssour, Rida Ait El, et al.
Published: (2025)
The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
by: Göller, Stefan, et al.
Published: (2023)
by: Göller, Stefan, et al.
Published: (2023)
Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
by: Lin, Deren, et al.
Published: (2014)
by: Lin, Deren, et al.
Published: (2014)
Reachability in Vector Addition System with States Parameterized by Geometric Dimension
by: Zheng, Yangluo
Published: (2024)
by: Zheng, Yangluo
Published: (2024)
Invariants for One-Counter Automata with Disequality Tests
by: Chistikov, Dmitry, et al.
Published: (2024)
by: Chistikov, Dmitry, et al.
Published: (2024)
Random Deterministic Automata With One Added Transition
by: Carayol, Arnaud, et al.
Published: (2024)
by: Carayol, Arnaud, et al.
Published: (2024)
General Decidability Results for Systems with Continuous Counters
by: Balasubramanian, A. R., et al.
Published: (2025)
by: Balasubramanian, A. R., et al.
Published: (2025)
Separators in Continuous Petri Nets
by: Blondin, Michael, et al.
Published: (2022)
by: Blondin, Michael, et al.
Published: (2022)
A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
by: Doveri, Kyveli, et al.
Published: (2026)
by: Doveri, Kyveli, et al.
Published: (2026)
A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)
by: Rooduijn, Jan, et al.
Published: (2024)
A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)
by: Haase, Christoph, et al.
Published: (2024)
The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)
by: Barloy, Corentin, et al.
Published: (2025)
Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)
by: Kuperberg, Denis
Published: (2022)
An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Resolving Nondeterminism with Randomness
by: Henzinger, Thomas A., et al.
Published: (2025)
by: Henzinger, Thomas A., et al.
Published: (2025)
Automating the Analysis of Quantitative Automata with QuAK
by: Chalupa, Marek, et al.
Published: (2025)
by: Chalupa, Marek, et al.
Published: (2025)
Extending QuAK with Nested Quantitative Automata
by: Henzinger, Thomas A., et al.
Published: (2026)
by: Henzinger, Thomas A., et al.
Published: (2026)
A Session Type System for Asynchronous Unreliable Broadcast Communication
by: Kouzapas, Dimitrios, et al.
Published: (2019)
by: Kouzapas, Dimitrios, et al.
Published: (2019)
History-deterministic Timed Automata
by: Bose, Sougata, et al.
Published: (2023)
by: Bose, Sougata, et al.
Published: (2023)
Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)
by: Abdulla, Parosh Aziz, et al.
Published: (2024)
AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
by: Chen, Yu-Fang, et al.
Published: (2024)
by: Chen, Yu-Fang, et al.
Published: (2024)
Simple grammar bisimilarity, with an application to session type equivalence
by: Poças, Diogo, et al.
Published: (2024)
by: Poças, Diogo, et al.
Published: (2024)
On Dependent Variables in Reactive Synthesis
by: Akshay, S., et al.
Published: (2024)
by: Akshay, S., et al.
Published: (2024)
Attractors of Parikh mapping iterations
by: Chunikhin, Alexander
Published: (2024)
by: Chunikhin, Alexander
Published: (2024)
Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
by: Caltais, Georgiana, et al.
Published: (2024)
by: Caltais, Georgiana, et al.
Published: (2024)
Logic and Languages of Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2024)
by: Amrane, Amazigh, et al.
Published: (2024)
Complete Test Suites for Automata in Monoidal Closed Categories
by: Kocsis, Bálint, et al.
Published: (2024)
by: Kocsis, Bálint, et al.
Published: (2024)
Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
by: Winter, Sarah, et al.
Published: (2024)
by: Winter, Sarah, et al.
Published: (2024)
Higher-Dimensional Timed Automata for Real-Time Concurrency
by: Amrane, Amazigh, et al.
Published: (2024)
by: Amrane, Amazigh, et al.
Published: (2024)
Deciding the synthesis problem for hybrid games through bisimulation
by: Dima, Catalin, et al.
Published: (2024)
by: Dima, Catalin, et al.
Published: (2024)
Similar Items
-
Reachability in 3-VASS is Elementary
by: Czerwiński, Wojciech, et al.
Published: (2025) -
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) -
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
by: Guha, Shibashis, et al.
Published: (2021)