A Counting Semantics for Monitoring LTL Specifications over Finite Traces

04/09/2018
by   Ezio Bartocci, et al.
0

We consider the problem of monitoring a Linear Time Logic (LTL) specification that is defined on infinite paths, over finite traces. For example, we may need to draw a verdict on whether the system satisfies or violates the property "p holds infinitely often." The problem is that there is always a continuation of a finite trace that satisfies the property and a different continuation that violates it. We propose a two-step approach to address this problem. First, we introduce a counting semantics that computes the number of steps to witness the satisfaction or violation of a formula for each position in the trace. Second, we use this information to make a prediction on inconclusive suffixes. In particular, we consider a good suffix to be one that is shorter than the longest witness for a satisfaction, and a bad suffix to be shorter than or equal to the longest witness for a violation. Based on this assumption, we provide a verdict assessing whether a continuation of the execution on the same system will presumably satisfy or violate the property.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/21/2022

Parametric Interval Temporal Logic over Infinite Words

Model checking for Halpern and Shoham's interval temporal logic HS has b...
research
03/06/2020

Teaching Temporal Logics to Neural Networks

We show that a deep neural network can learn the semantics of linear-tim...
research
09/08/2017

Monitoring of Traffic Manoeuvres with Imprecise Information

In monitoring, we algorithmically check if a single behavior satisfies a...
research
10/31/2018

Multirobot Coordination with Counting Temporal Logics

In many multirobot applications, planning trajectories in a way to guara...
research
05/18/2021

Quantitative and Approximate Monitoring

In runtime verification, a monitor watches a trace of a system and, if p...
research
07/12/2023

Designing Behavior Trees from Goal-Oriented LTLf Formulas

Temporal logic can be used to formally specify autonomous agent goals, b...
research
02/17/2020

Four-valued monitorability of ω-regular languages

Runtime Verification (RV) is a lightweight formal technique in which pro...

Please sign up or login with your details

Forgot password? Click here to reset