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 boun...

Full description

Saved in:
Bibliographic Details
Published inJournal of logical and algebraic methods in programming Vol. 111; p. 100515
Main Authors Aceto, Luca, Achilleos, Antonis, Francalanza, Adrian, Ingólfsdóttir, Anna, Kjartansson, Sævar Örn
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.02.2020
Subjects
Complexity bounds
Determinization
Hennessy-Milner logic
Monitorability
Runtime verification
Complexity bounds
Monitorability
Determinization
Hennessy-Milner logic
Runtime verification
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2352-2208
DOI:10.1016/j.jlamp.2019.100515