On the Complexity of Determinizing Monitors

@inproceedings{Aceto2017OnTC,
  title={On the Complexity of Determinizing Monitors},
  author={Luca Aceto and Antonis Achilleos and Adrian Francalanza and Anna Ing{\'o}lfsd{\'o}ttir and S{\ae}var {\"O}rn Kjartansson},
  booktitle={CIAA},
  year={2017}
}
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. 
The Cost of Monitoring Alone
TLDR
Borders of succinctness of two monitoring systems for properties of infinite traces are compared and it is shown that these bounds are tight and that they also hold for translations between corresponding fragments of Hennessy-Milner logic with recursion over infinite traces.
The Best a Monitor Can Do
TLDR
A definition of optimal monitors that verify the best monitorable underor over-approximation of a specification, regardless of its monitorability status is proposed, to enable prior knowledge to be optimally incorporated into runtime monitors.
Adventures in monitorability: from branching to linear time and back again
TLDR
This work establishes an expressiveness hierarchy of monitorable fragments of Hennessy-Milner logic with recursion in a linear-time setting and exactly identifies what kinds of guarantees can be given using runtime monitors for each fragment in the hierarchy.
1 Adventures in Monitorability From Branching to Linear Time and Back Again
TLDR
This work establishes an expressiveness hierarchy of monitorable fragments of Hennessy-Milner logic with recursion in a linear-time setting and exactly identifies what kinds of guarantees can be given using runtime monitors for each fragment in the hierarchy.
Monitoring for Silent Actions
TLDR
Monitorability aspects of a branching-time logic that employs silent actions is studied, identifying which formulas are monitorable for a number of instrumentation setups and establishing monitorability results for tolerating these imperfections.
Better Late Than Never or: Verifying Asynchronous Components at Runtime
TLDR
It is shown how a number of useful properties can be flexibly runtime verified via the three forms of instrumentation offered by detectEr to cater for specific system set-up constraints.
A theory of monitors
An Operational Guide to Monitorability
TLDR
This work presents a monitorability hierarchy and provides operational and syntactic characterisations for its levels, providing a unified framework that makes the operational assumptions and guarantees of each definition explicit.
Consistently-Detecting Monitors
TLDR
An alternative, coinductive definition based on controllability which does not rely on system quantifications is given, and it is shown that it is fully-abstract wrt.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
Efficient Monitoring of omega-Languages
TLDR
It is shown how Buchi automata can be reduced in size and transformed into special, statistically optimal nondeterministic finite state machines, called binary transition tree finite state Machines (BTT-FSMs), which recognize precisely the minimal bad prefixes of the original ω-regular-language.
Efficient Monitoring of ω-Languages
TLDR
It is shown how Büchi automata can be reduced in size and transformed into special, statistically optimal nondeterministic finite state machines, called binary transition tree finite state Machines (BTT-FSMs), which recognize precisely the minimal bad prefixes of the original ω-regular-language.
A Theory of Monitors - (Extended Abstract)
TLDR
A behavioural theory for monitors is developed — software entities that passively analyse the runtime behaviour of systems so as to infer properties about them and identifies contextual behavioural preorders that allow us to relate monitors according to criteria defined over monitored executions of piCalculus processes.
Finite Automata and Unary Languages
On Verifying Hennessy-Milner Logic with Recursion at Runtime
TLDR
Which subset of the logic can be verified at runtime and correct monitor-synthesis algorithms for this subset are established and it is proved these logical subsets that show that no other properties apart from those identified can beverified at runtime.
A Calculus of Communicating Systems
  • R. Milner
  • Computer Science
    Lecture Notes in Computer Science
  • 1980
TLDR
A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
Reasoning About Infinite Computations
TLDR
This work investigates extensions of temporal logic by connectives defined by finite automata on infinite words and shows that they do not increase the expressive power of the logic or the complexity of the decision problem.
Minimal NFA Problems are Hard
TLDR
This work studies the complexity of decision problems for finite automata and presents many fundamental decision problems which are computationally intractable even when the input is a DFA or a NFA with limited nondeterminism.
Finite Automata and Their Decision Problems
TLDR
Finite automata are considered as instruments for classifying finite tapes as well as generalizations of the notion of an automaton are introduced and their relation to the classical automata is determined.
Runtime Monitoring for Concurrent Systems
TLDR
This paper defines the syntax of CSP _E and its formal semantics, a runtime-monitoring framework based on Hoare's Communicating Sequential Processes that captures concurrency in the specification directly, and introduces a tool named stracematch, which is developed using it.
...
...