Abstract
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.
Cite
CITATION STYLE
Aceto, L., Achilleos, A., Francalanza, A., Ingólfsdóttir, A., & Kjartansson, S. Ö. (2017). On the complexity of determinizing monitors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10329 LNCS, pp. 1–13). Springer Verlag. https://doi.org/10.1007/978-3-319-60134-2_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
