Causal Past Logic for Runtime Verification of Distributed LLM Agent Workflows
Benedikt Bollig

TL;DR
This paper introduces Causal Past Logic (CPL), a new temporal logic for runtime verification of distributed LLM agent workflows, enabling causally-aware monitoring during execution.
Contribution
It extends the ZipperGen framework with CPL, allowing guards to inspect causally visible events and variables, integrating verification into the coordination language.
Findings
Developed a vector-clock monitor with latest-value views.
Proved monitor value matches denotational semantics of guards.
Runtime verification is integrated into the coordination language.
Abstract
Distributed LLM agent workflows should not be monitored as if they produced a single sequential log. In an asynchronous execution, a decision can only depend on events that are causally visible to the lifeline that makes it: an event that appears earlier in some log may still be unknown locally. We extend the ZipperGen agent-workflow framework with Causal Past Logic (CPL), a small past-time temporal logic for guards in conditionals and while loops. In addition to standard past-time modalities such as previous and since, a guard can inspect the latest causally visible event of another lifeline and selected variables stored there. The formula is a source-level guard: it is evaluated online by the owner lifeline and can influence control flow at runtime. We give a vector-clock monitor with latest-value views and prove that the locally computed monitor value coincides with the denotational…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
