Timed ATL: Forget Memory, Just Count
Authors: Michal Jozef Knapik, Etienne Andre, Laure Petrucci, Wojciech Jamroga, Wojciech Penczek
JAIR 2019 | Venue PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | The focus of the paper is theoretical: we study how the inclusion of timing information in a strategy influences the actual abilities of agents in the context of reachability and safety objectives. The paper is structured around definitions, lemmas, and theorems (e.g., Lemma 1, Lemma 2, Theorem 1, Theorem 2, Theorem 3, Theorem 4) and provides proofs for its claims, indicating a purely theoretical approach without empirical validation. |
| Researcher Affiliation | Academia | All authors are affiliated with academic institutions: LIPN, CNRS UMR 7030, Université Paris 13, Sorbonne Paris Cité and Institute of Computer Science, Polish Academy of Sciences. The email addresses (e.g., '@lipn.univ-paris13.fr', '@ipipan.waw.pl') also confirm academic affiliations. |
| Pseudocode | No | The paper describes strategy transformations and definitions using mathematical notation and natural language, such as 'We now alter σA to obtain c σA π as follows:' and 'We now define the counting strategy σ# A as follows:', but does not include any distinct, labeled pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not contain any statements about releasing source code, nor does it provide links to code repositories or supplementary materials containing code for the methodology described. |
| Open Datasets | No | The paper uses conceptual examples like 'Online services' (Example 1, 2, 3, 4, 5) and abstract models (e.g., TDCGS in Fig. 1, 2, 8, 11, 12, 13, 14) to illustrate theoretical concepts and proofs. It does not utilize or provide access information for any empirical datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments using datasets, therefore no dataset splits are discussed. |
| Hardware Specification | No | The paper focuses on theoretical investigations of Timed Alternating-time Temporal Logic (TATL) and its semantic variants. It does not describe any experiments that would require specific hardware, and thus no hardware specifications are provided. |
| Software Dependencies | No | The paper is a theoretical work on logic and strategic ability. It does not describe any software implementations or experiments, and therefore does not list any software dependencies or their version numbers. |
| Experiment Setup | No | The paper is theoretical and does not present any empirical experiments. Therefore, there are no specific experimental setup details, hyperparameter values, or training configurations mentioned in the main text. |