Deciding weak monitorability for runtime verification
Zhe Chen, Yifan Wu, Wei Ou, Bin Sheng · 2018
An important problem in runtime verification is monitorability. If a property is not monitorable, then it is meaningless to check it at runtime, as no satisfaction or violation will be reported in finite steps. In this paper, we revisit the classic definition of monitorability, and show that it is too restrictive for practical runtime verification. We propose a weaker but more practical definition of monitorability, say weak monitorability, and show how to decide weak monitorability for runtime verification.