Reachability for Updatable Timed Automata Made Faster and More Effective

Paul Gastin, Sayan Mukherjee 0002, B. Srivathsan. Reachability for Updatable Timed Automata Made Faster and More Effective. In Nitin Saxena 0001, Sunil Simon, editors, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference). Volume 182 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. [doi]

Abstract

Abstract is missing.