Runtime Verification of Traces under Recording Uncertainty

  • Shaohui Wang
  • Anaheed Ayoub
  • Oleg Sokolsky
  • Insup Lee
Conference paper

DOI: 10.1007/978-3-642-29860-8_35

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7186)
Cite this paper as:
Wang S., Ayoub A., Sokolsky O., Lee I. (2012) Runtime Verification of Traces under Recording Uncertainty. In: Khurshid S., Sen K. (eds) Runtime Verification. RV 2011. Lecture Notes in Computer Science, vol 7186. Springer, Berlin, Heidelberg

Abstract

We present an on-line algorithm for the runtime checking of temporal properties, expressed as past-time Linear Temporal Logic (LTL) over the traces of observations recorded by a “black box”-like device. The recorder captures the observed values but not the precise time of their occurrences, and precise truth evaluation of a temporal logic formula cannot always be obtained. In order to handle this uncertainty, the checking algorithm is based on a three-valued semantics for past-time LTL defined in this paper. In addition to the algorithm, the paper presents results of an evaluation that aimed to study the effects of the recording uncertainty on different kinds of temporal logic properties.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Shaohui Wang
    • 1
  • Anaheed Ayoub
    • 1
  • Oleg Sokolsky
    • 1
  • Insup Lee
    • 1
  1. 1.Department of Computer and Information ScienceUniversity of PennsylvaniaUSA

Personalised recommendations