Progression- vs Automata-based Anticipatory Monitoring of LTL over Finite Traces (Extended Version)

arXiv:2609.32912 · cs.LO, cs.AI · Submitted 2026-09-26 · Read on arXiv

cs.LO, cs.AI

Submitted: 2026-09-26

Updated: 2026-09-26

Code: https://github.com/black-sat/black

Terminology

• Trace — 102× in this paper · explained in 2 episodes
• Benchmark — 23× in this paper · explained in 2 episodes
• Verification — 14× in this paper · explained in 2 episodes
• Formal Methods — 5× in this paper · explained in 3 episodes
• Core — 3× in this paper · explained in 2 episodes
• Agentic System — 2× in this paper · explained in 2 episodes
• Accountability — 1× in this paper · explained in 2 episodes
• Alignment — 1× in this paper · explained in 1 episode
• Explainability — 1× in this paper · explained in 3 episodes
• Reward Function — 1× in this paper · explained in 2 episodes

Sources

• Monitoring Arithmetic Temporal Properties on Finite Traces

Related papers

• An Information-Flow Perspective on Explainability Requirements: Specification and Verification
• A programming language combining quantum and classical control
• Causal Past Logic for Runtime Verification of Distributed LLM Agent Workflows
• Encoder-Decoder Transformers: Logical Characterizations and Periodicity
• Ultraconstructive Model Theory via Bounded Adversarial Finite Structures