Pith. Sign in

RECORD

Memory Reduction via Delayed Simulation

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Marcus Gelderie (RWTH Aachen University), Michael Holtmann (RWTH Aachen University)

Computer Science and Game Theory · Submitted 21 Feb 2011

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim For the cases of specifications represented by "request-response"-requirements and general "fairness" conditions, we show that an exponential gain in the size of memory is possible.

how it is stated · asserted 0.72 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1102.4120 (version 1)
Pith ID4XNJJZME, Pith's permanent record of this paper and its review
CitationMarcus Gelderie (RWTH Aachen University), Michael Holtmann (RWTH Aachen University). "Memory Reduction via Delayed Simulation." arXiv:1102.4120 (2011). https://pith.science/paper/4XNJJZME
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 3,003 input tokens, $0.0001 reported.

What the abstract itself states, as probabilities: claims first 0.05 · states limitation 0.21 · human participants 0.01 · controlled comparison 0.04 · randomized assignment 0.01 · states quantitative result 0.83 · compares with prior results 0.19 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We address a central (and classical) issue in the theory of infinite games: the reduction of the memory size that is needed to implement winning strategies in regular infinite games (i.e., controllers that ensure correct behavior against actions of the environment, when the specification is a regular omega-language). We propose an approach which attacks this problem before the construction of a strategy, by first reducing the game graph that is obtained from the specification. For the cases of specifications represented by "request-response"-requirements and general "fairness" conditions, we show that an exponential gain in the size of memory is possible.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We address a central (and classical) issue in the theory of infinite games: the reduction of the memory size that is needed to implement winning strategies in regular infinite games (i.e., controllers that ensure correct behavior against actions of the environment, when the specification is a regular omega-language). background 1.00 0.10 0.06 asserted 0.74
s1 We propose an approach which attacks this problem before the construction of a strategy, by first reducing the game graph that is obtained from the specification. method 0.78 0.84 0.10 asserted 0.95
s2 For the cases of specifications represented by "request-response"-requirements and general "fairness" conditions, we show that an exponential gain in the size of memory is possible. result 1.00 0.92 0.72 asserted 0.72

What kind of paper the classifier reports this is: method or tool 0.72 · evidence from proof or derivation 0.98.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We address a central (and classical) issue in the theory of infinite games: the reduction of the memory size that is needed to implement winning strategies in regular infinite games (i.e., controllers that ensure correct behavior against actions of the environment, when the specification is a regular omega-language). We propose an approach which attacks this problem before the construction of a strategy, by first reducing the game graph that is obtained from the specification. For the cases of specifications represented by "request-response"-requirements and general "fairness" conditions, we show that an exponential gain in the size of memory is possible.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.