  Runtime verification is an area of formal methods that studies the dynamic
analysis of execution traces against formal specifications. Typically, the two
main activities in runtime verification efforts are the process of creating
monitors from specifications, and the algorithms for the evaluation of traces
against the generated monitors. Other activities involve the instrumentation of
the system to generate the trace and the communication between the system under
analysis and the monitor. Most of the applications in runtime verification have
been focused on the dynamic analysis of software, even though there are many
more potential applications to other computational devices and target systems.
In this paper we present a collection of challenges for runtime verification
extracted from concrete application domains, focusing on the difficulties that
must be overcome to tackle these specific challenges. The computational models
that characterize these domains require to devise new techniques beyond the
current state of the art in runtime verification.
