"On the Complexity of Timed Pattern Matching."

Eugene Asarin et al. (2021)
a service of  Schloss Dagstuhl - Leibniz Center for Informatics