Decidability of One-Clock Weighted Timed Games with Arbitrary Weights

Benjamin Monmege, Julie Parreaux, Pierre-Alain Reynier

Open source

DOI
10.46298/lmcs-21(1:8)2025
Published
2025-01-28
Container
Logical Methods in Computer Science
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.46298/lmcs-21-1:8-2025,
  title = {Decidability of One-Clock Weighted Timed Games with Arbitrary Weights},
  author = {Benjamin Monmege and Julie Parreaux and Pierre-Alain Reynier},
  year = {2025},
  journal = {Logical Methods in Computer Science},
  doi = {10.46298/lmcs-21(1:8)2025},
  url = {https://doi.org/10.46298/lmcs-21(1:8)2025}
}

RIS

TY  - JOUR
TI  - Decidability of One-Clock Weighted Timed Games with Arbitrary Weights
AU  - Benjamin Monmege
AU  - Julie Parreaux
AU  - Pierre-Alain Reynier
PY  - 2025
JO  - Logical Methods in Computer Science
DO  - 10.46298/lmcs-21(1:8)2025
UR  - https://doi.org/10.46298/lmcs-21(1:8)2025
ER  - 

APA

Monmege, B., Parreaux, J., & Reynier, P. (2025). Decidability of One-Clock Weighted Timed Games with Arbitrary Weights. Logical Methods in Computer Science. https://doi.org/10.46298/lmcs-21(1:8)2025

Source records