We present a new multi-valued monitoring approach for linear-time temporal logic that classifies trace prefixes not only according to the existence of correct and erroneous continuations, but also according to the strategic power of the system and its environment to avoid or enforce a violation of the specification. We classify the monitoring status into four levels: (1) the worst case is a violation, where no continuation satisfies the specification any more; (2) unrealizable means that the environment can force the system to violate the specification; (3) realizable means that the system can enforce that the specification is satisfied; (4) the best case, fulfilled, indicates that all possible continuations satisfy the specification. Because our approach recognizes situations where the system cannot avoid a violation even though there may still be continuations in which the specification is satisfied, our approach detects errors earlier, and it detects errors that are missed by less detailed classifications. We give an asymptotically optimal construction of multi-valued monitoring automata based on parity games.
KeywordsWinning Strategy Monitoring Realizability Runtime Monitoring Nondeterministic Automaton Environment Player
Unable to display preview. Download preview PDF.
- 1.Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. ACM Transactions on Software Engineering and Methodology 20(4) (2011)Google Scholar
- 2.Büchi, J., Landweber, L.: Solving sequential conditions by finite-state strategies. Trans. AMS (138) (1969)Google Scholar
- 8.Hopcroft, J.E.: An n log n algorithm for minimizing the states in a finite automaton. In: Kohavi, Z. (ed.) The Theory of Machines and Computations, pp. 189–196. Academic Press (1971)Google Scholar
- 14.Pnueli, A.: The temporal logic of programs. In: FOCS, pp. 46–57. IEEE (1977)Google Scholar
- 17.Sentovich, E., Singh, K., Lavagno, L., Moon, C., Murgai, R., Saldanha, A., Savoj, H., Stephan, P., Brayton, R.K., Sangiovanni-Vincentelli, A.L.: SIS: A system for sequential circuit synthesis. Technical Report UCB/ERL M92/41, EECS Department, University of California, Berkeley (1992)Google Scholar
- 18.Y., M., Vardi, T.W.: Automata: from logics to algorithms. In: Flum, J., Grädel, E., Wilke, T. (eds.) Logic and Automata: History and Perspectives. Texts in Logic and Games, vol. (2), pp. 629–736. Amsterdam University Press (2007)Google Scholar