On the Complexity of Determinizing Monitors [chapter]

Luca Aceto, Antonis Achilleos, Adrian Francalanza, Anna Ingólfsdóttir, Sævar Örn Kjartansson
2017 Lecture Notes in Computer Science  
We examine the determinization of monitors. 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. ?
doi:10.1007/978-3-319-60134-2_1 fatcat:2ijejls62ncxnct4ym27gzfegm