Monitoring events that carry data

Klaus Havelund, Giles Reger, Daniel Thoma, Eugen Zălinescu

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Very early runtime verification systems focused on monitoring what we can refer to as propositional events: just names of events. For this, finite state machines, standard regular expressions, or propositional temporal logics were sufficient formalisms for expressing properties. However, in practice there is a need for monitoring events that in addition carry data arguments. This adds complexity to both the property specification languages, and monitoring algorithms, which is reflected in the many alternative such approaches suggested in the literature. This chapter presents five different formalisms and monitoring approaches that support specifications with data, in order to illustrate the challenges and various solutions.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Nature
Pages61-102
Number of pages42
DOIs
Publication statusPublished - 1 Jan 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10457 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Keywords

  • Data rich events
  • Rule systems
  • Runtime verification
  • State machines
  • Stream processing
  • Temporal logic

Fingerprint

Dive into the research topics of 'Monitoring events that carry data'. Together they form a unique fingerprint.

Cite this