Tooling Offline Runtime Verification against Interaction Models : recognizing sliced behaviors using parameterized simulation

• URL: http://arxiv.org/abs/2403.03083v1
• Date: Tue, 5 Mar 2024 16:09:55 GMT
• Title: Tooling Offline Runtime Verification against Interaction Models : recognizing sliced behaviors using parameterized simulation
• Authors: Erwan Mahe, Boutheina Bannour, Christophe Gaston, Arnault Lapitre, Pascale Le Gall
• Abstract summary: offline runtime verification involves the static analysis of executions of a system against a specification. For distributed systems, it is generally not possible to characterize executions in the form of global traces, given the absence of a global clock. We propose an algorithm that verifies the conformity of such traces against formal specifications called Interactions.
• Score: 0.4199844472131921
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Offline runtime verification involves the static analysis of executions of a system against a specification. For distributed systems, it is generally not possible to characterize executions in the form of global traces, given the absence of a global clock. To account for this, we model executions as collections of local traces called multi-traces, with one local trace per group of co-localized actors that share a common clock. Due to the difficulty of synchronizing the start and end of the recordings of local traces, events may be missing at their beginning or end. Considering such partially observed multi-traces is challenging for runtime verification. To that end, we propose an algorithm that verifies the conformity of such traces against formal specifications called Interactions (akin to Message Sequence Charts). It relies on parameterized simulation to reconstitute unobserved behaviors.

Related papers

• Efficient Online Computation of Business Process State From Trace Prefixes via N-Gram Indexing [0.5141137421503899]
  Given a process model and an event log containing trace prefixes of ongoing cases of a process, map each case to its corresponding state in the model. An approach to this state computation problem is to perform a token-based replay of each trace prefix against the model. This paper proposes a method that, given a trace prefix of an ongoing case, computes its state in constant time using an index that represents states as n-grams.
  arXiv  Detail & Related papers  (2024-09-09T14:28:24Z)
• TraceMesh: Scalable and Streaming Sampling for Distributed Traces [51.08892669409318]
  TraceMesh is a scalable and streaming sampler for distributed traces. It accommodates previously unseen trace features in a unified and streamlined way. TraceMesh outperforms state-of-the-art methods by a significant margin in both sampling accuracy and efficiency.
  arXiv  Detail & Related papers  (2024-06-11T06:13:58Z)
• Sound Concurrent Traces for Online Monitoring Technical Report [0.0]
  concurrent programs typically rely on collecting traces to abstract program executions. We first define the notion of when a trace is representative of a concurrent execution. We then present a non-blocking vector clock algorithm to collect sound concurrent traces on the fly.
  arXiv  Detail & Related papers  (2024-02-28T15:11:39Z)
• Detecting Anomalous Events in Object-centric Business Processes via Graph Neural Networks [55.583478485027]
  This study proposes a novel framework for anomaly detection in business processes. We first reconstruct the process dependencies of the object-centric event logs as attributed graphs. We then employ a graph convolutional autoencoder architecture to detect anomalous events.
  arXiv  Detail & Related papers  (2024-02-14T14:17:56Z)
• Graph Spatiotemporal Process for Multivariate Time Series Anomaly Detection with Missing Values [67.76168547245237]
  We introduce a novel framework called GST-Pro, which utilizes a graphtemporal process and anomaly scorer to detect anomalies. Our experimental results show that the GST-Pro method can effectively detect anomalies in time series data and outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2024-01-11T10:10:16Z)
• End-to-end Tracking with a Multi-query Transformer [96.13468602635082]
  Multiple-object tracking (MOT) is a challenging task that requires simultaneous reasoning about location, appearance, and identity of the objects in the scene over time. Our aim in this paper is to move beyond tracking-by-detection approaches, to class-agnostic tracking that performs well also for unknown object classes.
  arXiv  Detail & Related papers  (2022-10-26T10:19:37Z)
• Inferring Unobserved Events in Systems With Shared Resources and Queues [0.8602553195689513]
  Real-life systems often record only a subset of all events taking place. To understand and analyze the behavior of processes with shared resources, we aim to reconstruct bounds for timestamps of events that must have happened but were not recorded. We use linear programming over entity traces to derive the timestamps of unobserved events in an efficient manner.
  arXiv  Detail & Related papers  (2021-02-27T09:34:01Z)
• A Background-Agnostic Framework with Adversarial Training for Abnormal Event Detection in Video [120.18562044084678]
  Abnormal event detection in video is a complex computer vision problem that has attracted significant attention in recent years. We propose a background-agnostic framework that learns from training videos containing only normal events.
  arXiv  Detail & Related papers  (2020-08-27T18:39:24Z)
• Partial Order Resolution of Event Logs for Process Conformance Checking [10.58705988536919]
  A key assumption of existing conformance checking techniques is that all events are associated with timestamps that allow to infer a total order of events per process instance. We present several estimators for this task, incorporating different notions of behavioral abstraction. Our experiments with real-world and synthetic data reveal that our approach improves accuracy over the state-of-the-art considerably.
  arXiv  Detail & Related papers  (2020-07-05T18:43:57Z)
• Deep Multi-Shot Network for modelling Appearance Similarity in Multi-Person Tracking applications [0.0]
  This article presents a Deep Multi-Shot neural model for measuring the Degree of Appearance Similarity (MS-DoAS) between person observations. The model has been deliberately trained to be able to manage the presence of previous identity switches and missed observations in the handled tracks. It has demonstrated a high capacity to discern when a new observation corresponds to a certain track, achieving a classification accuracy of 97% in a hard test.
  arXiv  Detail & Related papers  (2020-04-07T16:43:35Z)
• Spatio-Temporal Action Detection with Multi-Object Interaction [127.85524354900494]
  In this paper, we study the S-temporal action detection problem with multi-object interaction. We introduce a new dataset that is spatially annotated with action tubes containing multi-object interactions. We propose an end-to-endtemporal action detection model that performs both spatial and temporal regression simultaneously.
  arXiv  Detail & Related papers  (2020-04-01T00:54:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.