@misc{Lemke2024,
title = {{crmrtz/galois-energy-games}},
author = {Lemke, Caroline},
note = {Collection (visited on 2025-08-18)},
url = {https://github.com/crmrtz/galois-energy-games},
doi = {10.4230/artifacts.24329},
}
Description
The repository contains the underlying master's thesis "A Formal Proof of Decidability of Multi-weighted Declining Energy Games" written by Caroline Lemke at the Technical University of Berlin as well as the first Isabelle/HOL formalization of a decidability result for (Galois) energy games with reachability winning conditions.
Subject Classification
Programming Languages
Isabelle
TeX
Related Article
Caroline Lemke and Benjamin Bisping. Galois Energy Games: To Solve All Kinds of Quantitative Reachability Problems. In 36th International Conference on Concurrency Theory (CONCUR 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 348, pp. 29:1-29:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
https://doi.org/10.4230/LIPIcs.CONCUR.2025.29