Image de couverture de livre

Infinite-state Games with Energy Objectives Beyond Counters

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sağlam, Irmak, Zetzsche, Georg
Format:	Preprint
Publié:	2026
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

Directed Regular and Context-Free Languages
par: Ganardi, Moses, et autres
Publié: (2024)

The complexity of separability for semilinear sets and Parikh automata
par: Collins, Elias Rojas, et autres
Publié: (2024)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
par: Bergsträßer, Pascal, et autres
Publié: (2024)

General Decidability Results for Systems with Continuous Counters
par: Balasubramanian, A. R., et autres
Publié: (2025)

Bounded treewidth, multiple context-free grammars, and downward closures
par: Aiswarya, C., et autres
Publié: (2025)

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
par: Zetzsche, Stefan, et autres
Publié: (2024)

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

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

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

Global One-Counter Tree Automata
par: Herrmann, Luisa, et autres
Publié: (2024)

Two-Way One-Counter Nets Revisited
par: Almagor, Shaull, et autres
Publié: (2024)

Parameterized Verification of Systems with Precise (0,1)-Counter Abstraction
par: Eichler, Paul, et autres
Publié: (2024)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
par: Leys, Tim, et autres
Publié: (2024)

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

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

Verifying Unboundedness via Amalgamation
par: Anand, Ashwani, et autres
Publié: (2024)

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

Reversible Transducers over Infinite Words
par: Dartois, Luc, et autres
Publié: (2024)

Higher-Dimensional Automata : Extension to Infinite Tracks
par: Passemard, Luc, et autres
Publié: (2025)

Measure Many Quantum Finite Automata on Infinite Words
par: Midya, Abhisek, et autres
Publié: (2026)

Star Complexity of Parikh Images of Languages over Infinite Alphabets
par: Danieli, Yoav
Publié: (2026)

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

The Counting Power of Transformers
par: Sälzer, Marco, et autres
Publié: (2025)

Controller Synthesis for Parametric Timed Games
par: Dahlsen-Jensen, Mikael Bisgaard, et autres
Publié: (2025)

Token Games and History-Deterministic Quantitative-Automata
par: Boker, Udi, et autres
Publié: (2021)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
par: Acharya, Rohan, 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)

Beyond Decisiveness of Infinite Markov Chains
par: Barbot, Benoît, et autres
Publié: (2024)

You May Delay, but Time Will Not: Timed Games Under Delayed Control
par: Larsen, Kim G., et autres
Publié: (2025)

Backward Responsibility in Transition Systems Beyond Safety
par: Baier, Christel, et autres
Publié: (2025)

Nondeterministic state complexity of square root
par: Onishchenko, Sergey
Publié: (2026)

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

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

Characterizing Implementability of Global Protocols with Infinite States and Data
par: Li, Elaine, et autres
Publié: (2024)

Soft state reduction of fuzzy automata over residuated lattices
par: Nguyen, Linh Anh, et autres
Publié: (2025)

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

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

[Draft] High-order estimation-based properties and high-order observers for labeled finite-state automata
par: Zhang, Kuize, et autres
Publié: (2024)

Rabin Games and Colourful Universal Trees
par: Majumdar, Rupak, et autres
Publié: (2024)

Motion Planning for Automata-based Objectives using Efficient Gradient-based Methods
par: Balakrishnan, Anand, et autres
Publié: (2024)