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 (or as their labeled transition systems), then they can be exponentially more succinct than their CCS process form.

中文翻译：

---

通过递归确定HML的监视器

我们通过递归检查HML监视器的确定性。我们证明了每个监视器都等同于确定性监视器，确定性监视器的大小相对于原始监视器最大为双倍。当将监视器描述为类似于CCS的过程时，此双指数范围是最佳的。如果将（确定性）监视器描述为有限自动机（或其标记的过渡系统），则它们可以比其CCS过程形式更简洁。