@InProceedings{bhaskar_et_al:LIPIcs.TIME.2022.8,
author = {Bhaskar, Ashwin and Praveen, M.},
title = {{Realizability Problem for Constraint LTL}},
booktitle = {29th International Symposium on Temporal Representation and Reasoning (TIME 2022)},
pages = {8:1--8:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-262-4},
ISSN = {1868-8969},
year = {2022},
volume = {247},
editor = {Artikis, Alexander and Posenato, Roberto and Tonetta, Stefano},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2022.8},
URN = {urn:nbn:de:0030-drops-172556},
doi = {10.4230/LIPIcs.TIME.2022.8},
annote = {Keywords: Realizability, constraint LTL, Strategy trees, Tree automata}
}