arXiv Computer Science: "Reachability in two-parametric timed automata wit…" - CleverLibre Social

arXiv Computer Science @arxiv_cs@social.cleverlibre.org

Reachability in two-parametric timed automata with one parameter is EXPSPACE-complete. (arXiv:2011.07091v1 [cs.FL]) http://arxiv.org/abs/2011.07091

Nov 17, 2020, 03:00 · · feed2toot · · ·

Sign in to participate in the conversation