Observation strategies for event detection with incidence on runtime verification: theory, algorithms, experimentation

  • Marco Alberti
  • Pierangelo Dell’Acqua
  • Luís Moniz Pereira
Article

DOI: 10.1007/s10472-011-9259-5

Cite this article as:
Alberti, M., Dell’Acqua, P. & Pereira, L.M. Ann Math Artif Intell (2011) 62: 161. doi:10.1007/s10472-011-9259-5

Abstract

Many applications (such as system and user monitoring, runtime verification, diagnosis, observation-based decision making, intention recognition) all require to detect the occurrence of an event in a system, which entails the ability to observe the system. Observation can be costly, so it makes sense to try and reduce the number of observations, without losing full certainty about the event’s actual occurrence. In this paper, we propose a formalization of this problem. We formally show that, whenever the event to be detected follows a discrete spatial or temporal pattern, then it is possible to reduce the number of observations. We discuss exact and approximate algorithms to solve the problem, and provide an experimental evaluation of them. We apply the resulting algorithms to verification of linear temporal logics formulæ. Finally, we discuss possible generalizations and extensions, and, in particular, how event detection can benefit from logic programming techniques.

Keywords

Event detection Runtime verification Temporal logic Logic programming Complexity 

Mathematics Subject Classifications (2010)

68Q17 68U99 68W25 

Copyright information

© Springer Science+Business Media B.V. 2011

Authors and Affiliations

  • Marco Alberti
    • 1
  • Pierangelo Dell’Acqua
    • 2
  • Luís Moniz Pereira
    • 1
  1. 1.Centro de Inteligência Artificial (CENTRIA), Departamento de Informática, Faculdade de Ciências e TecnologiaUniversidade Nova de LisboaCaparicaPortugal
  2. 2.Dept. of Science and Technology, ITNLinköping UniversityNorrköpingSweden

Personalised recommendations