Image de couverture de livre

General Decidability Results for Systems with Continuous Counters

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Balasubramanian, A. R., Hague, Matthew, Majumdar, Rupak, Thinniyam, Ramanathan S., Zetzsche, Georg
Format:	Preprint
Publié:	2025
Sujets:	Formal Languages and Automata Theory Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Existential Definability over the Subword Ordering
par: Baumann, Pascal, et autres
Publié: (2022)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
par: Shakiba, Yousef, et autres
Publié: (2025)

The Complexity of Nested Reset Counter Systems
par: Balasubramanian, A. R., et autres
Publié: (2026)

Slice closures of indexed languages and word equations with counting constraints
par: Ciobanu, Laura, et autres
Publié: (2024)

Parameterized Verification of Quantum Circuits (Technical Report)
par: Abdulla, Parosh Aziz, et autres
Publié: (2025)

An efficient quantifier elimination procedure for Presburger arithmetic
par: Haase, Christoph, et autres
Publié: (2024)

Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking)
par: Lichtner, Kilian, et autres
Publié: (2025)

Parikh's Theorem Made Symbolic
par: Hague, Matthew, et autres
Publié: (2023)

MightyPPL: Verification of MITL with Past and Pnueli Modalities
par: Ho, Hsi-Ming, et autres
Publié: (2025)

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
par: Czerwiński, Wojciech, et autres
Publié: (2022)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
par: Barloy, Corentin, et autres
Publié: (2025)

Decidability Problems for Micro-Stipula
par: Delzanno, Giorgio, et autres
Publié: (2025)

Determinization of Min-Plus Weighted Automata is Decidable
par: Almagor, Shaull, et autres
Publié: (2025)

Characterization and Decidability of FC-Definable Regular Languages
par: Thompson, Sam M., et autres
Publié: (2025)

Negated String Containment is Decidable (Technical Report)
par: Havlena, Vojtěch, et autres
Publié: (2025)

Length Generalization Bounds for Transformers
par: Yang, Andy, et autres
Publié: (2026)

Deciding the synthesis problem for hybrid games through bisimulation
par: Dima, Catalin, et autres
Publié: (2024)

Invariants for One-Counter Automata with Disequality Tests
par: Chistikov, Dmitry, et autres
Publié: (2024)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
par: Guha, Shibashis, et autres
Publié: (2026)

The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
par: Daviaud, Laure, et autres
Publié: (2023)

Softmax Transformers are Turing-Complete
par: Jiang, Hongjian, et autres
Publié: (2025)

The complexity of downward closures of indexed languages
par: Mandel, Richard, et autres
Publié: (2026)

Infinite-state Games with Energy Objectives Beyond Counters
par: Sağlam, Irmak, et autres
Publié: (2026)

Synthesis and Verification of Transformer Programs (Technical Report)
par: Jiang, Hongjian, et autres
Publié: (2026)

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

Separators in Continuous Petri Nets
par: Blondin, Michael, et autres
Publié: (2022)

A Session Type System for Asynchronous Unreliable Broadcast Communication
par: Kouzapas, Dimitrios, et autres
Publié: (2019)

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

Extended CTG Generalization and Dynamic Adjustment of Generalization Strategies in IC3
par: Su, Yuheng, et autres
Publié: (2025)

Unreliability in Practical Subclasses of Communicating Systems
par: Suresh, Amrita, et autres
Publié: (2025)

Improving Reachability in Vector Addition Systems through Pumpability
par: Chen, Weijun, et autres
Publié: (2026)

The Complexity of Generalized HyperLTL with Stuttering and Contexts
par: Regaud, Gaëtan, et autres
Publié: (2025)

The Tractability Border of Reachability in Simple Vector Addition Systems with States
par: Chistikov, Dmitry, et autres
Publié: (2024)

Reachability in Vector Addition System with States Parameterized by Geometric Dimension
par: Zheng, Yangluo
Publié: (2024)

Random Graph Generation in Context-Free Graph Languages
par: Vastarini, Federico, et autres
Publié: (2024)

Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
par: Heck, Linus, et autres
Publié: (2025)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
par: Aceto, Luca, et autres
Publié: (2025)

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
par: Li, Shuo, et autres
Publié: (2023)

Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis
par: Besset, Antoine, et autres
Publié: (2025)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
par: Li, Junle, et autres
Publié: (2025)