arXiv (All)
open access
(Un)Decidability of Two-Clock Weighted Timed Games
The Value Problem for weighted timed games consists in determining, given a two-player weighted timed game with a reachability objective and a rational threshold, whether or not the value of the game exceeds the threshold. This problem is known to be undecidable for weighted timed games with three o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games#793755
- Reaching as Cheap as Possible in 1-clock Robust Weighted Timed Games#789750
- Simple games with minimum#1201854
- Monty Hall Resolved: The True Structure Behind the Perceived Paradox#113173
- Constitutive Rules: Games, Language, and Assertion#84807
Record · ID 1327240
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive