Determinizing Monitors for HML with Recursion
  We examine the determinization of monitors for HML with recursion. We demonstrate that every monitor is equivalent to a deterministic one, which is at most doubly exponential in size with respect to the original monitor. When monitors are described as CCS-like processes, this doubly exponential bound is optimal. When (deterministic) monitors are described as finite automata (as their LTS), then they can be exponentially more succinct than their CCS process form. 
Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna   Ing\'olfsd\'ottir and S{\ae}var \"Orn Kjartansson
cs.LO cs.FL