Inaproximability in weighted timed games

DOI10.4230/LIPICS.CONCUR.2024.27MaRDI QIDQ6859921zbMATH OpenFDO

Authors Quentin Guilmant, Joël Ouaknine

Publication date 10 February 2026

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

approximationundecidabilityweighted timed games

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

This page was built for publication: Inaproximability in weighted timed games

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