Deciding the Value of Two-Clock Almost Non-Zeno Weighted Timed Games

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Vialard, Isa
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Value Problem for Weighted Timed Games with Two Clocks is Undecidable
by: Guilmant, Quentin, et al.
Published: (2025)

On the cartesian product of well-orderings
by: Vialard, Isa
Published: (2022)

Ordinal measures of the set of finite multisets
by: Vialard, Isa
Published: (2023)

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

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

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

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

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

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

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)

On maximal order type of the lexicographic product
by: Džamonja, Mirna, et al.
Published: (2024)

Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets
by: Cesco, Arnaldo, et al.
Published: (2021)

On Polynomial-Time Decidability of k-Negations Fragments of First-Order Theories
by: Haase, Christoph, et al.
Published: (2024)

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

Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)

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

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

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)

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

The Constructive $μ$-calculus: Game Semantics and Non-Wellfounded Proof Systems
by: Pacheco, Leonardo
Published: (2026)

Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
by: Monmege, Benjamin, et al.
Published: (2022)

On Zeno-like Behaviors in the Event Calculus with Goal-directed Answer Set Programming
by: Vašíček, Ondřej, et al.
Published: (2026)

Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
by: Doyen, Laurent, et al.
Published: (2026)

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

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

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

Widest Path Games and Maximality Inheritance in Bounded Value Iteration for Stochastic Games
by: Phalakarn, Kittiphon, et al.
Published: (2025)

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

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

Decidability and Complexity of Decision Problems for Affine Continuous VASS
by: Balasubramanian, A. R.
Published: (2024)

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)

Decidable Reasoning About Time in Finite-Domain Situation Calculus Theories
by: Hofmann, Till, et al.
Published: (2024)

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

Deciding the Existence of Interpolants and Definitions in First-Order Modal Logic
by: Kurucz, Agi, et al.
Published: (2023)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

Traces via Strategies in Two-Player Games
by: Plummer, Benjamin, et al.
Published: (2025)

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