Decidability of one-clock weighted timed games with arbitrary weights

DOI10.46298/LMCS-21(1:8)2025MaRDI QIDQ7034350zbMATH OpenFDO

Authors Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier

Publication date 31 January 2025

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

algorithmic game theoryweighted timed gamestimed automata, value computation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithmic game theory and complexity (91A68)

This page was built for publication: Decidability of one-clock weighted timed games with arbitrary weights

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034350)