@inproceedings{majumdar_et_al:LIPIcs:2020:12540,
Address = {Dagstuhl, Germany},
Annote = {Keywords: CTMDP, Time bounded reachability, Continuous Skolem Problem, Schanuel's Conjecture},
Author = {Majumdar, Rupak and Salamati, Mahmoud and Soudjani, Sadegh},
BookTitle = {47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)},
Editor = {Czumaj, Artur and Dawar, Anuj and Merelli, Emanuela},
File = {On Decidability of Time-Bounded Reachability in CTMDPs - LIPIcs-ICALP-2020-133 - a - o.pdf},
ISBN = {978-3-95977-138-2},
ISSN = {1868-8969},
Pages = {133:1--133:19},
Publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
Title = {{On Decidability of Time-Bounded Reachability in CTMDPs}},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12540},
Volume = {168},
Year = {2020},
bdsk-url-1 = {https://drops.dagstuhl.de/opus/volltexte/2020/12540},
bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.ICALP.2020.133},
bdsk-url-3 = {https://youtu.be/VM2csUu3K3Y},
date-added = {2020-07-04 09:11:35 +0200},
date-modified = {2020-07-04 09:11:35 +0200},
urn = {urn:nbn:de:0030-drops-125408},
doi = {10.4230/LIPIcs.ICALP.2020.133}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A