pith. sign in

Title resolution pending

Proceedings, Part I, volume 8634 ofLecture Notes in Computer Science, pages 220–231 · 2014 · DOI 10.1007/978-3-662-44522-8_19

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.FL 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Infinite-state Games with Energy Objectives Beyond Counters

cs.FL · 2026-05-07 · unverdicted · novelty 7.0

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.

citing papers explorer

Showing 1 of 1 citing paper.

  • Infinite-state Games with Energy Objectives Beyond Counters cs.FL · 2026-05-07 · unverdicted · none · ref 6

    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.