A Note on Runtime Verification of Concurrent Systems

2025-07-07

AI Summary

This paper addresses the low information utilization efficiency of single execution traces in runtime verification of concurrent systems. We propose an efficient monitoring method grounded in trace semantics and three-valued Linear Temporal Logic over Traces (LTrL). Our approach treats partial-order executions as fundamental observational units, uniformly modeling all concurrent-equivalent interleavings. We introduce LTrL and trace-consistent Büchi automata to ensure monitors produce identical verdicts across all linearizations of a given trace. Furthermore, we adopt three-valued evaluation—accept, reject, or inconclusive—to enhance robustness under uncertainty. The synthesized monitor covers all concurrency-equivalent paths within a single observed execution, significantly improving information utilization and verification precision. This yields provably consistent runtime verification guarantees for concurrent systems.

Technology Category

• Reasoning under Uncertainty: Uncertainty Representations
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Knowledge Representation and Reasoning: Nonmonotonic Reasoning

Application Category

• Search and Retrieval-Augmented AI: Web evaluation methodologies and metrics
• Security and Privacy: Large-scale security measurements
• Semantics and Knowledge: Methods to enhance, augment, integrate or synergize semantic models such as knowledge graphs and LLMs

Abstract

To maximize the information gained from a single execution when verifying a concurrent system, one can derive all concurrency-aware equivalent executions and check them against linear specifications. This paper offers an alternative perspective on verification of concurrent systems by leveraging trace-based logics rather than sequence-based formalisms. Linear Temporal Logic over Mazurkiewicz Traces (LTrL) operates on partial-order representations of executions, meaning that once a single execution is specified, all equivalent interleavings are implicitly considered. This paper introduces a three valued version of LTrL, indicating whether the so-far observed execution of the concurrent system is one of correct, incorrect or inconclusive, together with a suitable monitor synthesis procedure. To this end, the paper recalls a construction of trace-consistent Büchi automata for LTrL formulas and explains how to employ it in well-understood monitor synthesis procedures. In this way, a monitor results that yields for any linearization of an observed trace the same verification verdict.

Problem

• Verifying concurrent systems using concurrency-aware executions
• Leveraging trace-based logics for concurrent system verification
• Introducing three-valued LTrL for runtime monitoring verdicts

Innovation

• Leverages trace-based logics for verification
• Introduces three-valued LTrL for execution assessment
• Employs trace-consistent Büchi automata construction