2013/07/02 by Zoltán Ésik, Ésik, Zoltán, Uli Fahrenberg +5
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Machine Learning and Algorithms #cs.FL #cs.LO #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.1307.0635
arxiv created 2013/07/02 · openalex publication_date 2013/07/02 · arxiv updated 2013/07/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
With the purpose of unifying a number of approaches to energy problems found in the literature, we introduce generalized energy automata. These are finite automata whose edges are labeled with energy functions that define how energy levels evolve during transitions. Uncovering a close connection between energy problems and reachability and Büchi acceptance for semiring-weighted automata, we show that these generalized energy problems are decidable. We also provide complexity results for important special cases.