Viability games on valence systems over graph monoids admit a complete decidability and complexity classification, with decidable cases in pushdown-counter combinations where non-termination games remain undecidable.
31 Jean-François Raskin, Mathias Samuelides, and Laurent Van Begin
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.FL 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Infinite-state Games with Energy Objectives Beyond Counters
Viability games on valence systems over graph monoids admit a complete decidability and complexity classification, with decidable cases in pushdown-counter combinations where non-termination games remain undecidable.