gemini_adk_rs/flow/

mod.rs

//! `Flow` — a governed conversation/tool DAG.
//!
//! A [`Flow`] is a directed acyclic graph of [`Step`]s. A `Step` is the *only*
//! node type; it unifies "conversation stage" and "tool-call milestone" by
//! differing only in attributes, not in kind. A step is *done* when its
//! completion [`Guard`] latches true; edges (`after`) are dependencies. The
//! [`FlowMonitor`] maintains a [`Marking`] (the set of done steps) by observing
//! the session trace, **projects** active steps' postures into turn-boundary
//! steering, and **enforces** ordering by admitting/denying tool calls.
//!
//! The vocabulary is deliberately closed: the only
//! nouns are `Flow`, `Step`, `Guard`, `Posture`, `Marking`, `Verdict`. Words
//! like *phase*, *transition*, *watch*, *needs* are lowering details and never
//! appear here.
//!
//! Because every [`Guard`] atom is a named, parameterized predicate, a `Flow`
//! is fully serializable — enabling data-driven scripts edited without a
//! recompile. The `custom` closure escape hatch is available in code but is not
//! serializable.

use std::collections::{BTreeMap, BTreeSet, HashMap};
use std::sync::Arc;

use serde::{Deserialize, Deserializer, Serialize, Serializer};
use serde_json::Value;

use crate::error::ConfigError;
use crate::orchestration::{AgentMode, call_agent};
use crate::state::State;
use crate::text::TextAgent;

/// Evaluation context handed to a [`Guard`]: the session state plus the
/// current flow marking.
pub struct FlowCtx<'a> {
    /// The session state.
    pub state: &'a State,
    /// The current flow marking (done steps + tool-call counts).
    pub marking: &'a Marking,
}

/// A serializable predicate atom — the closed set of guard primitives.
#[derive(Clone, Debug, Serialize, Deserialize, PartialEq, schemars::JsonSchema)]
#[serde(rename_all = "snake_case")]
pub enum Pred {
    /// Always true.
    Always,
    /// State key holds boolean `true`.
    IsTrue(String),
    /// State key is present.
    IsSet(String),
    /// State key equals the given JSON value.
    Eq(String, Value),
    /// All of the given state keys are present (e.g. extracted slots).
    Captured(Vec<String>),
    /// The named tool has completed successfully at least once.
    CalledOk(String),
    /// The named step is done.
    Done(String),
    /// Conjunction.
    All(Vec<Pred>),
    /// Disjunction.
    Any(Vec<Pred>),
    /// Negation.
    Not(Box<Pred>),
}

impl Pred {
    fn eval(&self, ctx: &FlowCtx) -> bool {
        match self {
            Pred::Always => true,
            Pred::IsTrue(k) => ctx.state.get::<bool>(k) == Some(true),
            Pred::IsSet(k) => ctx.state.contains(k),
            Pred::Eq(k, v) => ctx.state.get::<Value>(k).as_ref() == Some(v),
            Pred::Captured(fields) => fields.iter().all(|f| ctx.state.contains(f)),
            Pred::CalledOk(t) => ctx.marking.tool_ok.contains_key(t),
            Pred::Done(s) => ctx.marking.done.contains(s),
            Pred::All(ps) => ps.iter().all(|p| p.eval(ctx)),
            Pred::Any(ps) => ps.iter().any(|p| p.eval(ctx)),
            Pred::Not(p) => !p.eval(ctx),
        }
    }

    /// This predicate as a short prose clause. See [`Guard::describe`].
    fn describe(&self) -> String {
        fn join(ps: &[Pred], sep: &str) -> String {
            ps.iter().map(Pred::describe).collect::<Vec<_>>().join(sep)
        }
        match self {
            Pred::Always => "nothing".to_string(),
            Pred::IsTrue(k) => format!("'{k}' must be true"),
            Pred::IsSet(k) => format!("'{k}' must be known"),
            Pred::Eq(k, v) => format!("'{k}' must be {v}"),
            Pred::Captured(fields) => {
                format!("these must be known: {}", fields.join(", "))
            }
            Pred::CalledOk(t) => format!("'{t}' must have run successfully"),
            Pred::Done(s) => format!("step '{s}' must be complete"),
            Pred::All(ps) => join(ps, " and "),
            Pred::Any(ps) => join(ps, " or "),
            Pred::Not(p) => format!("it must not be the case that {}", p.describe()),
        }
    }

    /// Step ids referenced by `Done(..)` atoms (for validation).
    fn referenced_steps(&self, out: &mut Vec<String>) {
        match self {
            Pred::Done(s) => out.push(s.clone()),
            Pred::All(ps) | Pred::Any(ps) => ps.iter().for_each(|p| p.referenced_steps(out)),
            Pred::Not(p) => p.referenced_steps(out),
            _ => {}
        }
    }

    /// Tool names referenced by `called_ok` atoms (for reset forgiveness).
    fn referenced_tools(&self, out: &mut Vec<String>) {
        match self {
            Pred::CalledOk(t) => out.push(t.clone()),
            Pred::All(ps) | Pred::Any(ps) => ps.iter().for_each(|p| p.referenced_tools(out)),
            Pred::Not(p) => p.referenced_tools(out),
            _ => {}
        }
    }

    /// State keys this predicate reads (`is_true`/`is_set`/`eq`/`captured`
    /// atoms, recursively). `called_ok`/`done` reference tools/steps, not
    /// state, and are excluded.
    fn referenced_state_keys(&self, out: &mut BTreeSet<String>) {
        match self {
            Pred::IsTrue(k) | Pred::IsSet(k) | Pred::Eq(k, _) => {
                out.insert(k.clone());
            }
            Pred::Captured(fields) => out.extend(fields.iter().cloned()),
            Pred::All(ps) | Pred::Any(ps) => {
                ps.iter().for_each(|p| p.referenced_state_keys(out));
            }
            Pred::Not(p) => p.referenced_state_keys(out),
            _ => {}
        }
    }

    /// Evaluate to a [`GuardTrace`]: the predicate tree with each node's prose
    /// description and its truth value under `ctx`. The atom-granular answer
    /// to "why is this step not done?".
    fn explain(&self, ctx: &FlowCtx) -> GuardTrace {
        let children = match self {
            Pred::All(ps) | Pred::Any(ps) => ps.iter().map(|p| p.explain(ctx)).collect(),
            Pred::Not(p) => vec![p.explain(ctx)],
            _ => Vec::new(),
        };
        GuardTrace {
            desc: match self {
                // Composite nodes describe only the connective; the operands
                // carry their own descriptions as children.
                Pred::All(_) => "all of".to_string(),
                Pred::Any(_) => "any of".to_string(),
                Pred::Not(_) => "not".to_string(),
                atom => atom.describe(),
            },
            holds: self.eval(ctx),
            children,
        }
    }
}

/// A [`Guard`] evaluated to a truth tree: each predicate node with its prose
/// description and whether it currently holds. Serializable, so a devtool can
/// render exactly which atom a stuck step is waiting on.
#[derive(Clone, Debug, Serialize, schemars::JsonSchema)]
pub struct GuardTrace {
    /// Prose description of this node (from [`Guard::describe`] vocabulary).
    pub desc: String,
    /// Whether this node currently holds.
    pub holds: bool,
    /// Operand traces for `all`/`any`/`not`; empty for atoms.
    #[serde(default, skip_serializing_if = "Vec::is_empty")]
    pub children: Vec<GuardTrace>,
}

/// Render a grounding template against `state`.
///
/// - `{key}` interpolates the value at `key` (strings bare, other JSON compact);
///   an absent key renders empty.
/// - `{key?yes:no}` renders `yes` when `key` is *truthy* (present and not
///   `false`/`null`/`0`/`""`), else `no`.
///
/// This is the realization of `Effect::ground`: a deterministic projection of
/// known `State` into a steering line, so the model restates facts rather than
/// inventing them.
pub fn render_ground(template: &str, state: &State) -> String {
    let mut out = String::with_capacity(template.len());
    let mut rest = template;
    while let Some(open) = rest.find('{') {
        out.push_str(&rest[..open]);
        let after = &rest[open + 1..];
        let Some(close) = after.find('}') else {
            // Unbalanced brace: emit the remainder verbatim.
            out.push_str(&rest[open..]);
            return out;
        };
        let expr = &after[..close];
        out.push_str(&render_expr(expr, state));
        rest = &after[close + 1..];
    }
    out.push_str(rest);
    out
}

fn render_expr(expr: &str, state: &State) -> String {
    if let Some((cond, arms)) = expr.split_once('?') {
        let (yes, no) = arms.split_once(':').unwrap_or((arms, ""));
        if is_truthy(state, cond.trim()) {
            yes.to_string()
        } else {
            no.to_string()
        }
    } else {
        match state.get::<Value>(expr.trim()) {
            Some(Value::String(s)) => s,
            Some(v) => v.to_string(),
            None => String::new(),
        }
    }
}

fn is_truthy(state: &State, key: &str) -> bool {
    match state.get::<Value>(key) {
        None | Some(Value::Null) => false,
        Some(Value::Bool(b)) => b,
        Some(Value::Number(n)) => n.as_f64().map(|f| f != 0.0).unwrap_or(true),
        Some(Value::String(s)) => !s.is_empty(),
        Some(_) => true,
    }
}

type CustomFn = Arc<dyn Fn(&FlowCtx) -> bool + Send + Sync>;

/// A boolean predicate over `(state, marking)` — the *only* predicate type.
///
/// Use the constructors ([`Guard::is_true`], [`Guard::captured`],
/// [`Guard::called_ok`], …) for the serializable closed atoms, or
/// [`Guard::custom`] for a bespoke closure (not serializable).
#[derive(Clone)]
pub enum Guard {
    /// A serializable predicate built from the closed atom set.
    Spec(Pred),
    /// A code-only escape hatch. Not serializable.
    Custom(CustomFn),
}

impl Guard {
    /// Always true.
    pub fn always() -> Self {
        Guard::Spec(Pred::Always)
    }
    /// State key holds boolean `true`.
    pub fn is_true(key: impl Into<String>) -> Self {
        Guard::Spec(Pred::IsTrue(key.into()))
    }
    /// State key is present.
    pub fn is_set(key: impl Into<String>) -> Self {
        Guard::Spec(Pred::IsSet(key.into()))
    }
    /// State key equals the given JSON value.
    pub fn eq(key: impl Into<String>, value: impl Into<Value>) -> Self {
        Guard::Spec(Pred::Eq(key.into(), value.into()))
    }
    /// All of the given state keys are present (extracted slots).
    pub fn captured<I, S>(fields: I) -> Self
    where
        I: IntoIterator<Item = S>,
        S: Into<String>,
    {
        Guard::Spec(Pred::Captured(fields.into_iter().map(Into::into).collect()))
    }
    /// The named tool has completed successfully.
    pub fn called_ok(tool: impl Into<String>) -> Self {
        Guard::Spec(Pred::CalledOk(tool.into()))
    }
    /// The named step is done.
    pub fn done(step: impl Into<String>) -> Self {
        Guard::Spec(Pred::Done(step.into()))
    }
    /// True once an orchestrated agent named `name` has produced a result
    /// (its `{name}:result` state key is set). Pairs with the
    /// [`orchestration`](crate::orchestration) `call`/`dispatch`/`background`.
    pub fn resolved(name: impl AsRef<str>) -> Self {
        Guard::Spec(Pred::IsSet(format!("{}:result", name.as_ref())))
    }
    /// Conjunction.
    ///
    /// If every input is a serializable atom, the result is a serializable
    /// `Pred::All`. If any input is a [`Guard::custom`], the result is itself a
    /// custom guard that evaluates the conjunction at runtime — the custom guard
    /// is **never silently dropped** (it merely makes the combinator
    /// non-serializable, which surfaces as an error only if you try to serialize
    /// the flow).
    pub fn all(guards: impl IntoIterator<Item = Guard>) -> Self {
        let guards: Vec<Guard> = guards.into_iter().collect();
        if guards.iter().all(|g| matches!(g, Guard::Spec(_))) {
            Guard::Spec(Pred::All(specs_unchecked(guards)))
        } else {
            Guard::Custom(Arc::new(move |ctx| guards.iter().all(|g| g.eval(ctx))))
        }
    }
    /// Disjunction.
    ///
    /// Mirrors [`Guard::all`]: custom inputs are preserved as a runtime closure
    /// rather than erased.
    pub fn any(guards: impl IntoIterator<Item = Guard>) -> Self {
        let guards: Vec<Guard> = guards.into_iter().collect();
        if guards.iter().all(|g| matches!(g, Guard::Spec(_))) {
            Guard::Spec(Pred::Any(specs_unchecked(guards)))
        } else {
            Guard::Custom(Arc::new(move |ctx| guards.iter().any(|g| g.eval(ctx))))
        }
    }
    /// Negation of a serializable atom.
    #[allow(clippy::should_implement_trait)]
    pub fn not(guard: Guard) -> Self {
        match guard {
            Guard::Spec(p) => Guard::Spec(Pred::Not(Box::new(p))),
            // Negating a custom guard yields a custom guard.
            Guard::Custom(f) => Guard::Custom(Arc::new(move |ctx| !f(ctx))),
        }
    }
    /// This guard as a short prose clause, for telling a model what a refusal
    /// is waiting on.
    ///
    /// A refusal that names only the tool leaves the model to guess the
    /// precondition, and a wrong guess is indistinguishable from a wrong model:
    /// in the governed collections evaluation, `record_promise_to_pay` was
    /// refused with "not available in the current step", and the model — with
    /// nothing else to go on — decided it must need to re-verify the caller and
    /// asked for the card digits it had already checked.
    pub fn describe(&self) -> String {
        match self {
            Guard::Spec(p) => p.describe(),
            Guard::Custom(_) => "a condition set by the application".to_string(),
        }
    }

    /// A bespoke closure over `(state, marking)`. Not serializable.
    pub fn custom(f: impl Fn(&FlowCtx) -> bool + Send + Sync + 'static) -> Self {
        Guard::Custom(Arc::new(f))
    }

    /// Evaluate the guard.
    pub fn eval(&self, ctx: &FlowCtx) -> bool {
        match self {
            Guard::Spec(p) => p.eval(ctx),
            Guard::Custom(f) => f(ctx),
        }
    }

    /// Evaluate against state alone, with an empty [`Marking`].
    ///
    /// For contexts outside a governed flow (phase transitions, watcher
    /// conditions) where no marking exists: `called_ok`/`done` atoms evaluate
    /// `false` there — a validator should reject them in such positions.
    pub fn eval_state(&self, state: &State) -> bool {
        let marking = Marking::default();
        self.eval(&FlowCtx {
            state,
            marking: &marking,
        })
    }

    /// Evaluate to a [`GuardTrace`] — the predicate tree with per-node truth
    /// values. A [`Guard::custom`] yields a single opaque node.
    pub fn explain_trace(&self, ctx: &FlowCtx) -> GuardTrace {
        match self {
            Guard::Spec(p) => p.explain(ctx),
            Guard::Custom(f) => GuardTrace {
                desc: "a condition set by the application".to_string(),
                holds: f(ctx),
                children: Vec::new(),
            },
        }
    }

    fn referenced_steps(&self, out: &mut Vec<String>) {
        if let Guard::Spec(p) = self {
            p.referenced_steps(out);
        }
    }

    fn referenced_state_keys(&self, out: &mut BTreeSet<String>) {
        if let Guard::Spec(p) = self {
            p.referenced_state_keys(out);
        }
    }

    fn referenced_tools(&self, out: &mut Vec<String>) {
        if let Guard::Spec(p) = self {
            p.referenced_tools(out);
        }
    }
}

/// Unwrap a list of guards known to be all `Spec` into their predicates.
///
/// The caller (`Guard::all`/`Guard::any`) only invokes this after verifying every
/// guard is a `Spec`, so the `Custom` arm is unreachable.
fn specs_unchecked(guards: Vec<Guard>) -> Vec<Pred> {
    guards
        .into_iter()
        .map(|g| match g {
            Guard::Spec(p) => p,
            Guard::Custom(_) => unreachable!("specs_unchecked called with a custom guard"),
        })
        .collect()
}

impl Serialize for Guard {
    fn serialize<S: Serializer>(&self, s: S) -> Result<S::Ok, S::Error> {
        match self {
            Guard::Spec(p) => p.serialize(s),
            Guard::Custom(_) => Err(serde::ser::Error::custom(
                "custom guards are not serializable; use Guard atoms for data-driven flows",
            )),
        }
    }
}

impl<'de> Deserialize<'de> for Guard {
    fn deserialize<D: Deserializer<'de>>(d: D) -> Result<Self, D::Error> {
        Ok(Guard::Spec(Pred::deserialize(d)?))
    }
}

// A serializable guard is exactly a `Pred` atom on the wire (the `Custom`
// variant is code-only and rejected by `Serialize`), so its JSON Schema is
// `Pred`'s. Inline the `Pred` subschema wherever a `Guard` appears.
impl schemars::JsonSchema for Guard {
    fn is_referenceable() -> bool {
        false
    }
    fn schema_name() -> String {
        "Guard".to_string()
    }
    fn json_schema(generator: &mut schemars::r#gen::SchemaGenerator) -> schemars::schema::Schema {
        generator.subschema_for::<Pred>()
    }
}

impl std::fmt::Debug for Guard {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        match self {
            Guard::Spec(p) => write!(f, "{p:?}"),
            Guard::Custom(_) => write!(f, "Custom(<fn>)"),
        }
    }
}

/// A dependency edge into a step.
///
/// In JSON, a plain string (`"verify"`) is an unconditional edge — satisfied
/// once the source step is done. An object (`{"step": "triage", "when":
/// {"is_true": "routine"}}`) is a **conditional edge**: satisfied only while
/// the source is done *and* the guard holds. Conditional edges out of one
/// source into sibling steps are how a flow branches; pair them with
/// [`Join::Any`] on the merge step. Unconditional edges serialize back to the
/// plain string form, so existing documents round-trip unchanged.
#[derive(Clone, Debug)]
pub struct Edge {
    /// The source step this edge depends on.
    pub step: String,
    /// Optional condition; the edge is satisfied only while it holds.
    pub when: Option<Guard>,
}

impl Edge {
    /// An unconditional edge from `step`.
    pub fn to(step: impl Into<String>) -> Self {
        Edge {
            step: step.into(),
            when: None,
        }
    }
    /// A conditional edge from `step`, satisfied only while `when` holds.
    pub fn when(step: impl Into<String>, when: Guard) -> Self {
        Edge {
            step: step.into(),
            when: Some(when),
        }
    }
}

impl<S: Into<String>> From<S> for Edge {
    fn from(step: S) -> Self {
        Edge::to(step)
    }
}

impl Serialize for Edge {
    fn serialize<S: Serializer>(&self, s: S) -> Result<S::Ok, S::Error> {
        match &self.when {
            // Unconditional edges keep the original plain-string form.
            None => self.step.serialize(s),
            Some(when) => {
                use serde::ser::SerializeStruct;
                let mut out = s.serialize_struct("Edge", 2)?;
                out.serialize_field("step", &self.step)?;
                out.serialize_field("when", when)?;
                out.end()
            }
        }
    }
}

impl<'de> Deserialize<'de> for Edge {
    fn deserialize<D: Deserializer<'de>>(d: D) -> Result<Self, D::Error> {
        #[derive(Deserialize)]
        #[serde(untagged)]
        enum Repr {
            Simple(String),
            Conditional {
                step: String,
                #[serde(default)]
                when: Option<Guard>,
            },
        }
        Ok(match Repr::deserialize(d)? {
            Repr::Simple(step) => Edge { step, when: None },
            Repr::Conditional { step, when } => Edge { step, when },
        })
    }
}

impl schemars::JsonSchema for Edge {
    fn schema_name() -> String {
        "Edge".to_string()
    }
    fn json_schema(generator: &mut schemars::r#gen::SchemaGenerator) -> schemars::schema::Schema {
        #[derive(schemars::JsonSchema)]
        #[serde(untagged)]
        #[allow(dead_code)]
        enum EdgeSchema {
            Simple(String),
            Conditional { step: String, when: Option<Pred> },
        }
        EdgeSchema::json_schema(generator)
    }
}

/// How a step's dependency edges combine.
#[derive(
    Clone, Copy, Debug, Default, PartialEq, Eq, Serialize, Deserialize, schemars::JsonSchema,
)]
#[serde(rename_all = "snake_case")]
pub enum Join {
    /// Every edge must be satisfied (the default — a synchronizing join).
    #[default]
    All,
    /// Any one satisfied edge suffices — the merge node after a branch.
    Any,
}

impl Join {
    fn is_all(&self) -> bool {
        *self == Join::All
    }
}

/// A node in the flow DAG — the only node type.
#[derive(Clone, Debug, Serialize, Deserialize, schemars::JsonSchema)]
pub struct Step {
    /// Unique step id.
    pub id: String,
    /// Dependency edges; how they combine is set by `join`.
    #[serde(default, skip_serializing_if = "Vec::is_empty")]
    pub after: Vec<Edge>,
    /// How the `after` edges combine: `all` (default) or `any`.
    #[serde(default, skip_serializing_if = "Join::is_all")]
    pub join: Join,
    /// Extra eligibility predicate beyond dependencies.
    #[serde(default, skip_serializing_if = "Option::is_none")]
    pub gate: Option<Guard>,
    /// Completion condition. Required for non-terminal steps.
    #[serde(default, skip_serializing_if = "Option::is_none")]
    pub done: Option<Guard>,
    /// Instruction imposed while this step is active (projected as steering).
    #[serde(default, skip_serializing_if = "Option::is_none")]
    pub posture: Option<String>,
    /// A grounding template projected while active: a curated, `State`-interpolated
    /// fact line that pins the model to known values (anti-hallucination). See
    /// [`render_ground`]. Serializable, like `posture`.
    #[serde(default, skip_serializing_if = "Option::is_none")]
    pub ground: Option<String>,
    /// Tools available while this step is active (whitelist; empty = no restriction).
    #[serde(default, skip_serializing_if = "Vec::is_empty")]
    pub allow: Vec<String>,
    /// Tools forbidden while this step is active.
    #[serde(default, skip_serializing_if = "Vec::is_empty")]
    pub deny: Vec<String>,
    /// A terminal step — reaching it (deps + gate) marks it done with no milestone.
    #[serde(default, skip_serializing_if = "std::ops::Not::not")]
    pub terminal: bool,
}

/// A cross-cutting flow constraint.
#[derive(Clone, Debug, Serialize, Deserialize, schemars::JsonSchema)]
#[serde(rename_all = "snake_case")]
pub enum Constraint {
    /// A tool may complete at most once.
    Once(String),
    /// Step `0` must be done before step `1` starts.
    Before(String, String),
    /// A tool is forbidden until the guard holds.
    NeverUntil {
        /// The gated tool.
        tool: String,
        /// The guard that must hold to permit it.
        until: Guard,
    },
    /// These steps must be done for the flow to be complete.
    Require(Vec<String>),
    /// Un-latch the named steps when the guard *becomes* true (rising edge) —
    /// the loop primitive. The DAG stays acyclic and statically checkable;
    /// iteration is explicit marking surgery instead of back-edges.
    ///
    /// A reset also forgives the completion evidence the steps' `done` guards
    /// reference: `called_ok` counts for those tools are cleared (so a `once`
    /// on such a tool permits one run per latch-cycle). State keys the guards
    /// read are the application's to clear — a reset never touches [`State`].
    Reset {
        /// The steps to un-latch.
        steps: Vec<String>,
        /// Fires on this guard's rising edge.
        when: Guard,
    },
}

/// A governed conversation/tool DAG.
#[derive(Clone, Debug, Default, Serialize, Deserialize, schemars::JsonSchema)]
pub struct Flow {
    /// The steps (DAG nodes).
    pub steps: Vec<Step>,
    /// Cross-cutting constraints.
    #[serde(default, skip_serializing_if = "Vec::is_empty")]
    pub constraints: Vec<Constraint>,
    /// Tools that require confirmation when reached (set by `commit`).
    #[serde(default, skip_serializing_if = "Vec::is_empty")]
    pub confirm_tools: Vec<String>,
    /// Cross-cutting tools exempt from step `allow` whitelists.
    ///
    /// A step's `allow` list excludes by omission, which is correct for the
    /// domain tools a step is *about* and wrong for infrastructure no step is
    /// about — memory recall, escalation, logging. Naming a tool here says "this
    /// is not part of any step's repertoire", not "this is ungovernable":
    /// `deny`, `once` and `never(..).until(..)` all still bind, because each of
    /// those *names* the tool and so is a decision about it.
    #[serde(default, skip_serializing_if = "Vec::is_empty")]
    pub ambient: Vec<String>,
}

impl Flow {
    /// Start building a flow.
    #[allow(
        clippy::new_ret_no_self,
        reason = "Flow::new() is the builder entry point; a Flow comes from FlowBuilder::build/compile"
    )]
    pub fn new() -> FlowBuilder {
        FlowBuilder::default()
    }

    fn step(&self, id: &str) -> Option<&Step> {
        self.steps.iter().find(|s| s.id == id)
    }

    /// Validate referential integrity and acyclicity. Every problem found is
    /// reported in the returned [`ConfigError`], not just the first.
    pub fn validate(&self) -> Result<(), ConfigError> {
        let mut errs = Vec::new();
        let ids: BTreeSet<&str> = self.steps.iter().map(|s| s.id.as_str()).collect();
        if ids.len() != self.steps.len() {
            errs.push("duplicate step ids".into());
        }
        for s in &self.steps {
            for d in &s.after {
                if !ids.contains(d.step.as_str()) {
                    errs.push(format!(
                        "step '{}' depends on unknown step '{}'",
                        s.id, d.step
                    ));
                }
                if let Some(when) = &d.when {
                    let mut refs = Vec::new();
                    when.referenced_steps(&mut refs);
                    for r in refs {
                        if !ids.contains(r.as_str()) {
                            errs.push(format!(
                                "step '{}' edge condition references unknown step '{r}'",
                                s.id
                            ));
                        }
                    }
                }
            }
            if !s.terminal && s.done.is_none() {
                errs.push(format!(
                    "non-terminal step '{}' has no `done` condition (it can never complete)",
                    s.id
                ));
            }
            for g in s.gate.iter().chain(s.done.iter()) {
                let mut refs = Vec::new();
                g.referenced_steps(&mut refs);
                for r in refs {
                    if !ids.contains(r.as_str()) {
                        errs.push(format!(
                            "step '{}' guard references unknown step '{r}'",
                            s.id
                        ));
                    }
                }
            }
        }
        for c in &self.constraints {
            match c {
                Constraint::Before(a, b) => {
                    for x in [a, b] {
                        if !ids.contains(x.as_str()) {
                            errs.push(format!("constraint `before` references unknown step '{x}'"));
                        }
                    }
                }
                Constraint::Require(rs) => {
                    for r in rs {
                        if !ids.contains(r.as_str()) {
                            errs.push(format!(
                                "constraint `require` references unknown step '{r}'"
                            ));
                        }
                    }
                }
                Constraint::Reset { steps, .. } => {
                    for r in steps {
                        if !ids.contains(r.as_str()) {
                            errs.push(format!("constraint `reset` references unknown step '{r}'"));
                        }
                    }
                }
                _ => {}
            }
        }
        if self.has_cycle() {
            errs.push("flow dependency graph has a cycle (must be a DAG)".into());
        }
        ConfigError::from_issues(errs)
    }

    /// Every tool name referenced anywhere in the flow (allow/deny/once/
    /// never_until/confirm). The universe over which [`ToolSurface`] reasons.
    fn tool_universe(&self) -> BTreeSet<String> {
        let mut tools = BTreeSet::new();
        for s in &self.steps {
            tools.extend(s.allow.iter().cloned());
            tools.extend(s.deny.iter().cloned());
        }
        for c in &self.constraints {
            match c {
                Constraint::Once(t) => {
                    tools.insert(t.clone());
                }
                Constraint::NeverUntil { tool, .. } => {
                    tools.insert(tool.clone());
                }
                _ => {}
            }
        }
        tools.extend(self.confirm_tools.iter().cloned());
        tools.extend(self.ambient.iter().cloned());
        tools
    }

    /// Every state key any guard in the flow reads (`is_true`/`is_set`/`eq`/
    /// `captured` atoms in step gates, completion guards, and `never…until`
    /// constraints).
    ///
    /// A key in this set that nothing in the session *writes* — no tool, no
    /// extractor, no promotion — can never latch, which is the dominant silent
    /// failure in data-authored flows. Validators diff this set against the
    /// declared writers to catch it at load time, the way
    /// [`compile_with_tools`](Self::compile_with_tools) catches tool typos.
    pub fn state_keys_read(&self) -> BTreeSet<String> {
        let mut keys = BTreeSet::new();
        for s in &self.steps {
            for g in s.gate.iter().chain(s.done.iter()) {
                g.referenced_state_keys(&mut keys);
            }
            for e in &s.after {
                if let Some(when) = &e.when {
                    when.referenced_state_keys(&mut keys);
                }
            }
        }
        for c in &self.constraints {
            match c {
                Constraint::NeverUntil { until, .. } => until.referenced_state_keys(&mut keys),
                Constraint::Reset { when, .. } => when.referenced_state_keys(&mut keys),
                _ => {}
            }
        }
        keys
    }

    /// Steps reachable from a root (a step with no `after` deps), following both
    /// `after` edges and `Before(a, b)` ordering edges.
    fn reachable_steps(&self) -> BTreeSet<String> {
        let ids: BTreeSet<&str> = self.steps.iter().map(|s| s.id.as_str()).collect();
        // Forward edges: a -> b when b.after contains a, or Before(a, b).
        let mut succ: BTreeMap<&str, Vec<&str>> = BTreeMap::new();
        for s in &self.steps {
            for d in &s.after {
                if ids.contains(d.step.as_str()) {
                    succ.entry(d.step.as_str()).or_default().push(s.id.as_str());
                }
            }
        }
        for c in &self.constraints {
            if let Constraint::Before(a, b) = c
                && ids.contains(a.as_str())
                && ids.contains(b.as_str())
            {
                succ.entry(a.as_str()).or_default().push(b.as_str());
            }
        }
        let roots: Vec<&str> = self
            .steps
            .iter()
            .filter(|s| s.after.is_empty())
            .map(|s| s.id.as_str())
            .collect();
        let mut seen = BTreeSet::new();
        let mut stack = roots;
        while let Some(id) = stack.pop() {
            if seen.insert(id.to_string())
                && let Some(next) = succ.get(id)
            {
                stack.extend(next.iter().copied());
            }
        }
        seen
    }

    /// Compile and validate the flow into a [`CompiledFlow`], turning a class of
    /// runtime surprises into load-time errors.
    ///
    /// On top of [`validate`](Self::validate)'s referential/acyclicity checks this
    /// reports: unreachable steps, commit tools guarded by an always-true
    /// condition (an effectively *unguarded* commit, which defeats the
    /// confirm-before-commit contract), `never…until` guards whose `done(step)`
    /// atoms reference unknown steps (unsatisfiable — the tool would be forbidden
    /// forever), and ordering cycles across the combined `after` + `before` edges
    /// (which deadlock every step on the cycle). Precomputes the [`ToolSurface`]
    /// universe.
    ///
    /// To additionally validate tool names against a known registry, use
    /// [`compile_with_tools`](Self::compile_with_tools).
    pub fn compile(self) -> Result<CompiledFlow, FlowErrors> {
        self.compile_internal(None)
    }

    /// Compile like [`compile`](Self::compile), additionally validating every
    /// tool name the flow references (step `allow`/`deny`, `once`,
    /// `never…until`, and commit/confirm tools) against the given registry of
    /// known tool names.
    ///
    /// A referenced tool missing from `tools` is reported as
    /// [`FlowError::UnknownTool`] — catching typos and drift between a flow
    /// script and the tools actually registered on the session.
    ///
    /// ```ignore
    /// let compiled = flow.compile_with_tools(&["lookup_account", "charge_card"])?;
    /// ```
    pub fn compile_with_tools(self, tools: &[&str]) -> Result<CompiledFlow, FlowErrors> {
        self.compile_internal(Some(tools))
    }

    fn compile_internal(self, registry: Option<&[&str]>) -> Result<CompiledFlow, FlowErrors> {
        let mut errors = Vec::new();
        if let Err(err) = self.validate() {
            errors.extend(err.issues.into_iter().map(FlowError::Invalid));
        }

        // Graph-shape checks (only meaningful once the graph is acyclic/valid).
        if errors.is_empty() {
            // Unreachable steps.
            let reachable = self.reachable_steps();
            for s in &self.steps {
                if !reachable.contains(&s.id) {
                    errors.push(FlowError::UnreachableStep(s.id.clone()));
                }
            }
            // Ordering cycles across the combined `after` + `before(a, b)` edges.
            // `validate()` only walks `after`; a cycle closed by a `Before`
            // constraint deadlocks every step on it (none can become eligible).
            if let Some(cycle) = self.ordering_cycle() {
                errors.push(FlowError::OrderingCycle(cycle));
            }
        }

        // A commit tool guarded by an always-true condition is effectively
        // unguarded — the confirm-before-commit contract would never gate it.
        for tool in &self.confirm_tools {
            let guard = self.constraints.iter().find_map(|c| match c {
                Constraint::NeverUntil { tool: t, until } if t == tool => Some(until),
                _ => None,
            });
            let unguarded = matches!(guard, None | Some(Guard::Spec(Pred::Always)));
            if unguarded {
                errors.push(FlowError::UnguardedCommitTool(tool.clone()));
            }
        }

        // An unsatisfiable `never(tool).until(guard)`: the guard's `done(step)`
        // atom references a step that doesn't exist, so it can never latch and
        // the tool is forbidden forever. (Step gate/done guards are already
        // covered by `validate()`; constraints were not.)
        let ids: BTreeSet<&str> = self.steps.iter().map(|s| s.id.as_str()).collect();
        for c in &self.constraints {
            if let Constraint::NeverUntil { tool, until } = c {
                let mut refs = Vec::new();
                until.referenced_steps(&mut refs);
                for r in refs {
                    if !ids.contains(r.as_str()) {
                        errors.push(FlowError::UnsatisfiableGuard {
                            tool: tool.clone(),
                            step: r,
                        });
                    }
                }
            }
        }

        // Dangling tool names vs a known registry (opt-in).
        if let Some(known) = registry {
            for tool in self.tool_universe() {
                if !known.contains(&tool.as_str()) {
                    errors.push(FlowError::UnknownTool(tool));
                }
            }
        }

        if errors.is_empty() {
            let surface = ToolSurface {
                tools: self.tool_universe(),
            };
            Ok(CompiledFlow {
                flow: self,
                surface,
            })
        } else {
            Err(FlowErrors(errors))
        }
    }

    /// Find a cycle over the combined dependency edges (`after` plus
    /// `before(a, b)` ordering constraints), if any. Returns the step ids on
    /// the cycle path. `None` when the combined graph is acyclic.
    fn ordering_cycle(&self) -> Option<Vec<String>> {
        // Predecessor edges: step -> everything that must be done before it.
        let mut deps: BTreeMap<&str, Vec<&str>> = BTreeMap::new();
        for s in &self.steps {
            let entry = deps.entry(s.id.as_str()).or_default();
            entry.extend(s.after.iter().map(|e| e.step.as_str()));
        }
        for c in &self.constraints {
            if let Constraint::Before(a, b) = c {
                deps.entry(b.as_str()).or_default().push(a.as_str());
            }
        }
        // DFS with colors; on a back-edge, report the current path suffix.
        fn dfs<'a>(
            id: &'a str,
            deps: &BTreeMap<&'a str, Vec<&'a str>>,
            color: &mut BTreeMap<&'a str, u8>,
            path: &mut Vec<&'a str>,
        ) -> Option<Vec<String>> {
            color.insert(id, 1);
            path.push(id);
            for d in deps.get(id).into_iter().flatten() {
                match color.get(d).copied() {
                    Some(1) => {
                        let start = path.iter().position(|p| p == d).unwrap_or(0);
                        return Some(
                            path[start..]
                                .iter()
                                .map(std::string::ToString::to_string)
                                .collect(),
                        );
                    }
                    Some(2) => {}
                    _ => {
                        if let Some(cycle) = dfs(d, deps, color, path) {
                            return Some(cycle);
                        }
                    }
                }
            }
            path.pop();
            color.insert(id, 2);
            None
        }
        let mut color: BTreeMap<&str, u8> = BTreeMap::new();
        for s in &self.steps {
            if color.get(s.id.as_str()).copied().unwrap_or(0) == 0 {
                let mut path = Vec::new();
                if let Some(cycle) = dfs(&s.id, &deps, &mut color, &mut path) {
                    return Some(cycle);
                }
            }
        }
        None
    }

    fn has_cycle(&self) -> bool {
        // DFS with colors over the `after` dependency edges.
        let mut color: BTreeMap<&str, u8> = BTreeMap::new();
        fn dfs<'a>(flow: &'a Flow, id: &'a str, color: &mut BTreeMap<&'a str, u8>) -> bool {
            color.insert(id, 1);
            if let Some(step) = flow.step(id) {
                for d in &step.after {
                    match color.get(d.step.as_str()).copied() {
                        Some(1) => return true,
                        Some(2) => {}
                        _ => {
                            if dfs(flow, &d.step, color) {
                                return true;
                            }
                        }
                    }
                }
            }
            color.insert(id, 2);
            false
        }
        for s in &self.steps {
            if color.get(s.id.as_str()).copied().unwrap_or(0) == 0 && dfs(self, &s.id, &mut color) {
                return true;
            }
        }
        false
    }

    /// Render the flow as a Mermaid `flowchart` — the spec *is* the diagram.
    pub fn to_mermaid(&self) -> String {
        let mut out = String::from("flowchart TD\n");
        for s in &self.steps {
            let shape = if s.terminal {
                format!("    {}([{}])\n", s.id, s.id)
            } else {
                format!("    {}[{}]\n", s.id, s.id)
            };
            out.push_str(&shape);
        }
        for s in &self.steps {
            for d in &s.after {
                match &d.when {
                    Some(when) => {
                        let label = when.describe().replace('|', "/");
                        out.push_str(&format!("    {} -->|{label}| {}\n", d.step, s.id));
                    }
                    None => out.push_str(&format!("    {} --> {}\n", d.step, s.id)),
                }
            }
        }
        out
    }
}

/// The runtime position in a flow: which steps are done and how often each
/// tool has succeeded.
#[derive(Clone, Debug, Default)]
pub struct Marking {
    /// Steps that have latched done.
    pub done: BTreeSet<String>,
    /// Per-tool successful-completion counts.
    pub tool_ok: BTreeMap<String, u32>,
    /// Turns observed.
    pub turns: u32,
}

/// The conformance status of a step.
#[derive(Clone, Copy, Debug, PartialEq, Eq, Serialize, Deserialize)]
#[serde(rename_all = "snake_case")]
pub enum Verdict {
    /// Not yet eligible.
    Pending,
    /// Eligible and awaiting completion.
    Active,
    /// Completed.
    Done,
    /// A successor completed while this never did (an out-of-order deviation).
    Skipped,
}

/// A recorded conformance deviation (observe mode) or denial (enforce mode).
#[derive(Clone, Debug, Serialize, Deserialize, PartialEq)]
pub struct Violation {
    /// What was attempted (e.g. a tool name).
    pub subject: String,
    /// Why it was a violation.
    pub reason: String,
}

/// How a [`FlowMonitor`] treats off-path activity — enforcement vs observation.
///
/// Distinct from [`AgentMode`], which is the unrelated *resolver execution
/// discipline* (`Call`/`Dispatch`/`Background`).
#[derive(Clone, Copy, Debug, PartialEq, Eq, Default)]
pub enum Enforcement {
    /// Block inadmissible tool calls and steer back on-path.
    #[default]
    Enforce,
    /// Allow everything, but record deviations for audit/analytics.
    Observe,
}

/// An action fired the first time a step becomes active: run an agent in an
/// [`AgentMode`]. Built with [`on_enter`]. The result lands in `{name}:result` (the
/// name defaults to the step id), so a *downstream* step can complete on it via
/// [`Guard::resolved`] — this is how a flow drives orchestration in-session.
#[derive(Clone)]
pub struct StepAction {
    name: Option<String>,
    agent: Arc<dyn TextAgent>,
    mode: AgentMode,
}

/// Build a step-enter action that runs `agent` in `mode` when the step first
/// activates. Pair with [`FlowMonitor::on_enter`].
///
/// ```ignore
/// let mon = FlowMonitor::new(flow, Enforcement::Enforce)
///     .on_enter("check", on_enter(availability_agent, AgentMode::Dispatch));
/// ```
pub fn on_enter(agent: Arc<dyn TextAgent>, mode: AgentMode) -> StepAction {
    StepAction {
        name: None,
        agent,
        mode,
    }
}

impl StepAction {
    /// Override the result name (defaults to the step id it is attached to).
    pub fn named(mut self, name: impl Into<String>) -> Self {
        self.name = Some(name.into());
        self
    }

    /// Run the action. `Call` awaits inline; `Dispatch`/`Background` spawn it
    /// detached so the turn is never blocked.
    pub(crate) async fn fire(&self, step_id: &str, state: &State) {
        let name = self.name.clone().unwrap_or_else(|| step_id.to_string());
        match self.mode {
            AgentMode::Call => {
                let _ = call_agent(&name, self.agent.clone(), state).await;
            }
            AgentMode::Dispatch | AgentMode::Background => {
                let agent = self.agent.clone();
                let state = state.clone();
                tokio::spawn(async move {
                    let _ = call_agent(&name, agent, &state).await;
                });
            }
        }
    }
}

/// A shared, lock-protected [`FlowMonitor`] — the form in which the Live
/// control plane owns a governed flow, so runtime surfaces (e.g.
/// [`LiveHandle::explain`](crate::live::LiveHandle::explain)) can
/// snapshot it concurrently. All monitor methods are synchronous: lock
/// briefly and never hold the guard across an `await`.
pub type SharedFlowMonitor = Arc<parking_lot::Mutex<FlowMonitor>>;

/// Observes the session trace, maintains the [`Marking`], answers tool
/// admissibility, and projects active postures.
pub struct FlowMonitor {
    flow: Flow,
    mode: Enforcement,
    marking: Marking,
    violations: Vec<Violation>,
    /// Per-step actions fired the first time the step becomes active.
    enter_actions: HashMap<String, StepAction>,
    /// Steps whose `on_enter` action has already fired (fire-once).
    announced: BTreeSet<String>,
    /// Previous guard values for `Constraint::Reset` rising-edge detection,
    /// in constraint order.
    reset_prev: Vec<bool>,
}

impl FlowMonitor {
    /// Create a monitor for a (presumed-valid) flow.
    ///
    /// Prefer [`FlowMonitor::compiled`] or [`FlowMonitor::try_new`], which carry
    /// proof of compilation; this convenience skips compilation for flows already
    /// known valid (e.g. built in-process by trusted code).
    pub fn new(flow: Flow, mode: Enforcement) -> Self {
        Self {
            flow,
            mode,
            marking: Marking::default(),
            violations: Vec::new(),
            enter_actions: HashMap::new(),
            announced: BTreeSet::new(),
            reset_prev: Vec::new(),
        }
    }

    /// Create a monitor from a [`CompiledFlow`] — the validated path.
    pub fn compiled(flow: CompiledFlow, mode: Enforcement) -> Self {
        Self::new(flow.into_flow(), mode)
    }

    /// Compile `flow` and create a monitor, surfacing structural errors instead
    /// of trusting the caller.
    pub fn try_new(flow: Flow, mode: Enforcement) -> Result<Self, FlowErrors> {
        Ok(Self::compiled(flow.compile()?, mode))
    }

    /// Wrap this monitor in a [`SharedFlowMonitor`] for shared ownership
    /// between the control lane (which advances it) and runtime accessors
    /// (which snapshot it, e.g.
    /// [`LiveHandle::explain`](crate::live::LiveHandle::explain)).
    pub fn into_shared(self) -> SharedFlowMonitor {
        Arc::new(parking_lot::Mutex::new(self))
    }

    /// Explain the current control-plane state: active steps, which tools are
    /// admitted vs blocked (with reasons), and unmet requirements.
    ///
    /// This is the deterministic answer to "why did the assistant ask that?" —
    /// model-readable, without the model driving control flow.
    pub fn explain(&self, state: &State) -> FlowExplanation {
        let active_steps = self.active_steps(state);
        let active: Vec<String> = active_steps.iter().map(|s| s.id.clone()).collect();
        let ctx = self.ctx(state);
        let active_progress = active_steps
            .iter()
            .filter_map(|s| {
                s.done
                    .as_ref()
                    .map(|g| (s.id.clone(), g.explain_trace(&ctx)))
            })
            .collect();
        let mut allowed_tools = Vec::new();
        let mut blocked_tools = BTreeMap::new();
        for tool in self.flow.tool_universe() {
            match self.admits_tool(&tool, state) {
                Ok(()) => allowed_tools.push(tool),
                Err(reason) => {
                    blocked_tools.insert(tool, reason);
                }
            }
        }
        FlowExplanation {
            active,
            allowed_tools,
            blocked_tools,
            missing_requirements: self.unmet_requirements(),
            active_progress,
        }
    }

    /// Attach an action fired the first time `step` becomes active (see
    /// [`on_enter`](on_enter())). Chainable at construction time.
    pub fn on_enter(mut self, step: impl Into<String>, action: StepAction) -> Self {
        self.enter_actions.insert(step.into(), action);
        self
    }

    /// Steps that became active since the last call — each reported exactly once
    /// over the session. Drives [`on_enter`](Self::on_enter) firing.
    pub fn take_newly_active(&mut self, state: &State) -> Vec<String> {
        let mut fresh = Vec::new();
        for s in self.active_steps(state) {
            if !self.announced.contains(&s.id) {
                fresh.push(s.id.clone());
            }
        }
        for id in &fresh {
            self.announced.insert(id.clone());
        }
        fresh
    }

    /// The enter-action registered for a step, if any.
    pub fn enter_action(&self, step: &str) -> Option<&StepAction> {
        self.enter_actions.get(step)
    }

    /// Fire enter-actions for every step that just became active. Convenience
    /// over [`take_newly_active`](Self::take_newly_active) + [`enter_action`](Self::enter_action);
    /// call it right after [`on_turn`](Self::on_turn).
    pub async fn fire_enter_actions(&mut self, state: &State) {
        for id in self.take_newly_active(state) {
            if let Some(action) = self.enter_actions.get(&id) {
                action.fire(&id, state).await;
            }
        }
    }

    /// The enforcement mode this monitor runs in.
    pub fn mode(&self) -> Enforcement {
        self.mode
    }

    /// Replace a step's posture in place. Returns `false` if no such step.
    ///
    /// Postures are re-projected at every turn boundary, so an edit takes
    /// effect on the next turn — the safe subset of live spec editing. The
    /// DAG, guards, and tool gates are structural and stay fixed.
    pub fn set_posture(&mut self, step_id: &str, posture: Option<String>) -> bool {
        match self.flow.steps.iter_mut().find(|s| s.id == step_id) {
            Some(step) => {
                step.posture = posture;
                true
            }
            None => false,
        }
    }

    /// Replace a step's grounding template in place. Returns `false` if no
    /// such step. Same next-turn semantics as [`set_posture`](Self::set_posture).
    pub fn set_ground(&mut self, step_id: &str, ground: Option<String>) -> bool {
        match self.flow.steps.iter_mut().find(|s| s.id == step_id) {
            Some(step) => {
                step.ground = ground;
                true
            }
            None => false,
        }
    }

    /// Evaluate a [`Guard`] against this monitor's current context (the given
    /// `state` plus the monitor's marking). Used to test overlay/digression
    /// triggers without exposing the internal context.
    pub fn eval(&self, guard: &Guard, state: &State) -> bool {
        guard.eval(&self.ctx(state))
    }
    /// The current marking.
    pub fn marking(&self) -> &Marking {
        &self.marking
    }
    /// Recorded violations.
    pub fn violations(&self) -> &[Violation] {
        &self.violations
    }
    /// The underlying flow.
    pub fn flow(&self) -> &Flow {
        &self.flow
    }

    fn ctx<'a>(&'a self, state: &'a State) -> FlowCtx<'a> {
        FlowCtx {
            state,
            marking: &self.marking,
        }
    }

    fn eligible(&self, step: &Step, state: &State) -> bool {
        let ctx = self.ctx(state);
        let edge_ok = |e: &Edge| {
            self.marking.done.contains(&e.step)
                && e.when.as_ref().map(|g| g.eval(&ctx)).unwrap_or(true)
        };
        let deps_done = if step.after.is_empty() {
            true
        } else {
            match step.join {
                Join::All => step.after.iter().all(edge_ok),
                Join::Any => step.after.iter().any(edge_ok),
            }
        };
        // Enforce `Constraint::Before(a, step)`: `a` must be done before this
        // step may start (an ordering constraint declared outside `after`).
        let before_ok = self.flow.constraints.iter().all(|c| match c {
            Constraint::Before(a, b) if *b == step.id => self.marking.done.contains(a),
            _ => true,
        });
        let gate_ok = step
            .gate
            .as_ref()
            .map(|g| g.eval(&self.ctx(state)))
            .unwrap_or(true);
        deps_done && before_ok && gate_ok
    }

    /// Re-evaluate completion latches to a fixpoint. Call after any event that
    /// can change state or the marking (turn boundary, tool completion).
    ///
    /// [`Constraint::Reset`] constraints are applied first, on their guard's
    /// rising edge: the named steps un-latch, their `on_enter` re-arms, and
    /// the `called_ok` evidence their completion guards reference is forgiven
    /// — the loop primitive over an otherwise monotonic marking.
    pub fn relatch(&mut self, state: &State) {
        self.apply_resets(state);
        loop {
            let mut newly_done: Vec<String> = Vec::new();
            for s in &self.flow.steps {
                if self.marking.done.contains(&s.id) {
                    continue;
                }
                if !self.eligible(s, state) {
                    continue;
                }
                let complete = if s.terminal {
                    true
                } else {
                    s.done
                        .as_ref()
                        .map(|g| g.eval(&self.ctx(state)))
                        .unwrap_or(false)
                };
                if complete {
                    newly_done.push(s.id.clone());
                }
            }
            if newly_done.is_empty() {
                break;
            }
            for id in newly_done {
                self.marking.done.insert(id);
            }
        }
    }

    /// Apply [`Constraint::Reset`] constraints on their guards' rising edges.
    fn apply_resets(&mut self, state: &State) {
        // Evaluate all guards first (immutable borrow), then mutate.
        let mut edges: Vec<(usize, bool)> = Vec::new();
        {
            let ctx = self.ctx(state);
            for (i, c) in self.flow.constraints.iter().enumerate() {
                if let Constraint::Reset { when, .. } = c {
                    edges.push((i, when.eval(&ctx)));
                }
            }
        }
        for (slot, (index, now)) in edges.into_iter().enumerate() {
            let prev = self.reset_prev.get(slot).copied().unwrap_or(false);
            if self.reset_prev.len() <= slot {
                self.reset_prev.resize(slot + 1, false);
            }
            self.reset_prev[slot] = now;
            if !now || prev {
                continue;
            }
            let Constraint::Reset { steps, .. } = &self.flow.constraints[index] else {
                continue;
            };
            let steps = steps.clone();
            for step_id in &steps {
                if !self.marking.done.remove(step_id) {
                    continue;
                }
                self.announced.remove(step_id);
                // Forgive the completion evidence this step's done guard
                // references, so `called_ok` (and any `once` on those tools)
                // count per latch-cycle. State keys stay the app's to clear.
                if let Some(step) = self.flow.steps.iter().find(|s| &s.id == step_id) {
                    let mut tools = Vec::new();
                    if let Some(done) = &step.done {
                        done.referenced_tools(&mut tools);
                    }
                    for tool in tools {
                        self.marking.tool_ok.remove(&tool);
                    }
                }
            }
        }
    }

    /// Record a turn boundary, then re-latch.
    pub fn on_turn(&mut self, state: &State) {
        self.marking.turns += 1;
        self.relatch(state);
    }

    /// Record a successful tool call, then re-latch.
    pub fn on_tool_ok(&mut self, tool: &str, state: &State) {
        *self.marking.tool_ok.entry(tool.to_string()).or_insert(0) += 1;
        self.relatch(state);
    }

    /// Steps that are eligible but not yet done.
    pub fn active_steps(&self, state: &State) -> Vec<&Step> {
        self.flow
            .steps
            .iter()
            .filter(|s| !self.marking.done.contains(&s.id) && self.eligible(s, state))
            .collect()
    }

    /// Postures of the active steps — to inject as turn-boundary steering.
    pub fn active_postures(&self, state: &State) -> Vec<String> {
        self.active_steps(state)
            .into_iter()
            .filter_map(|s| s.posture.clone())
            .collect()
    }

    /// Rendered grounding lines of the active steps — curated, `State`-
    /// interpolated facts to inject as turn-boundary steering (anti-hallucination).
    pub fn active_grounds(&self, state: &State) -> Vec<String> {
        self.active_steps(state)
            .into_iter()
            .filter_map(|s| s.ground.as_ref().map(|t| render_ground(t, state)))
            .filter(|s| !s.trim().is_empty())
            .collect()
    }

    /// Required steps not yet done (drives repair).
    pub fn unmet_requirements(&self) -> Vec<String> {
        self.flow
            .constraints
            .iter()
            .flat_map(|c| match c {
                Constraint::Require(rs) => rs.clone(),
                _ => Vec::new(),
            })
            .filter(|r| !self.marking.done.contains(r))
            .collect()
    }

    /// Whether all required steps are done.
    pub fn is_complete(&self) -> bool {
        self.unmet_requirements().is_empty()
    }

    /// The conformance verdict for a step.
    pub fn verdict(&self, step_id: &str, state: &State) -> Verdict {
        if self.marking.done.contains(step_id) {
            return Verdict::Done;
        }
        if let Some(step) = self.flow.step(step_id)
            && self.eligible(step, state)
        {
            return Verdict::Active;
        }
        // Skipped: a successor is done but this step never completed.
        let bypassed = self.flow.steps.iter().any(|s| {
            s.after.iter().any(|d| d.step == step_id) && self.marking.done.contains(&s.id)
        });
        if bypassed {
            Verdict::Skipped
        } else {
            Verdict::Pending
        }
    }

    /// Decide whether a tool call may proceed. `Ok(())` admits it; `Err(reason)`
    /// denies it (the caller blocks in Enforce mode, or records in Observe).
    pub fn admits_tool(&self, tool: &str, state: &State) -> Result<(), String> {
        match self.admissibility(tool, state) {
            Ok(()) => Ok(()),
            Err(denial) => Err(self.render_denial(tool, &denial, state)),
        }
    }

    /// The admissibility decision, before it is put into words.
    ///
    /// Split from [`admits_tool`](Self::admits_tool) so that rendering a refusal
    /// can itself ask what *is* admissible without recursing: this function never
    /// renders, so `render_denial` may call it over the whole tool universe.
    fn admissibility(&self, tool: &str, state: &State) -> Result<(), Denial> {
        // 1. once(tool)
        for c in &self.flow.constraints {
            if let Constraint::Once(t) = c
                && t == tool
                && self.marking.tool_ok.contains_key(tool)
            {
                return Err(Denial::OnceExhausted);
            }
        }
        // 2. never(tool).until(guard)
        for c in &self.flow.constraints {
            if let Constraint::NeverUntil { tool: t, until } = c
                && t == tool
                && !until.eval(&self.ctx(state))
            {
                return Err(Denial::NotYet(until.describe()));
            }
        }
        // 3. active allow/deny (whitelist while any active step restricts).
        let active = self.active_steps(state);
        if let Some(step) = active.iter().find(|s| s.deny.iter().any(|d| d == tool)) {
            return Err(Denial::DeniedByStep(step.id.clone()));
        }
        // An ambient tool is exempt from the whitelist's exclusion-by-omission,
        // having already cleared every constraint that names it explicitly.
        if self.flow.ambient.iter().any(|a| a == tool) {
            return Ok(());
        }
        let restricting: Vec<&&Step> = active.iter().filter(|s| !s.allow.is_empty()).collect();
        if !restricting.is_empty()
            && !restricting
                .iter()
                .any(|s| s.allow.iter().any(|a| a == tool))
        {
            return Err(Denial::NotInStep(
                restricting.iter().map(|s| s.id.clone()).collect(),
            ));
        }
        Ok(())
    }

    /// Put a refusal into words the model can act on.
    ///
    /// A refusal reaches the model as a tool error, and it is the only thing the
    /// model learns about the gate. "'X' is not available in the current step"
    /// names what failed and nothing about what would succeed, so the model is
    /// left to infer the precondition — and in the governed collections
    /// evaluation it inferred wrongly, re-asking a verified caller for their card
    /// digits after `record_promise_to_pay` was refused. The monitor knows the
    /// active step, what that step is waiting for, and which tools *are*
    /// admitted; every refusal now carries it.
    fn render_denial(&self, tool: &str, denial: &Denial, state: &State) -> String {
        let head = match denial {
            Denial::OnceExhausted => {
                // Nothing to redirect to: the answer is "you already did this".
                return format!(
                    "'{tool}' has already run and may run only once in this \
                     conversation. Do not call it again."
                );
            }
            Denial::NotYet(condition) => {
                format!("'{tool}' is not permitted yet — first, {condition}.")
            }
            Denial::DeniedByStep(step) => {
                format!("'{tool}' is not allowed during the current step ('{step}').")
            }
            Denial::NotInStep(steps) => format!(
                "'{tool}' is not part of the current step ({}).",
                steps
                    .iter()
                    .map(|s| format!("'{s}'"))
                    .collect::<Vec<_>>()
                    .join(", ")
            ),
        };

        // What the model may do instead. Drawn from the flow's own tool
        // universe, so it never invents a tool the session has not declared.
        let available: Vec<String> = self
            .flow
            .tool_universe()
            .into_iter()
            .filter(|t| self.admissibility(t, state).is_ok())
            .collect();

        let mut out = head;
        if available.is_empty() {
            out.push_str(" No tool is available right now — continue the conversation instead.");
        } else {
            out.push_str(" Available now: ");
            out.push_str(&available.join(", "));
            out.push('.');
        }
        // The posture is the step's own words for what it wants; repeating it
        // here means the redirection and the reason arrive together, rather than
        // the model having to reconcile an error with steering sent earlier.
        let postures = self.active_postures(state);
        if let Some(first) = postures.first() {
            out.push(' ');
            out.push_str(first);
        }
        out
    }

    /// Observe a tool call for conformance. In Enforce mode the caller has
    /// already gated via [`admits_tool`](Self::admits_tool); this records the
    /// call and, in Observe mode, logs a deviation if it was inadmissible.
    pub fn observe_tool(&mut self, tool: &str, ok: bool, state: &State) {
        if self.mode == Enforcement::Observe
            && let Err(reason) = self.admits_tool(tool, state)
        {
            self.violations.push(Violation {
                subject: tool.to_string(),
                reason,
            });
        }
        if ok {
            self.on_tool_ok(tool, state);
        }
    }
}

/// Why a tool call was refused, before it is rendered into prose.
///
/// Structured rather than a string so the renderer can add the redirection —
/// what *is* available, and what the active step is waiting for — which is the
/// half a model needs and the old message never carried.
enum Denial {
    /// A `once(tool)` constraint, already spent.
    OnceExhausted,
    /// A `never(tool).until(guard)` whose guard has not latched; carries the
    /// rendered guard.
    NotYet(String),
    /// The named active step lists the tool in `deny`.
    DeniedByStep(String),
    /// Active steps restrict by `allow` and none of them names the tool;
    /// carries the restricting step ids.
    NotInStep(Vec<String>),
}

/// A single problem found while compiling a [`Flow`].
#[derive(Debug, Clone, PartialEq, Eq, Serialize)]
#[serde(tag = "kind", content = "detail", rename_all = "snake_case")]
pub enum FlowError {
    /// A referential-integrity or acyclicity error from [`Flow::validate`].
    Invalid(String),
    /// A step that no path from a root can ever reach.
    UnreachableStep(String),
    /// A commit (confirm) tool whose gate is always true — effectively
    /// unguarded, defeating confirm-before-commit.
    UnguardedCommitTool(String),
    /// A tool referenced by the flow (step `allow`/`deny`, `once`,
    /// `never…until`, confirm) that is not in the registry given to
    /// [`Flow::compile_with_tools`].
    UnknownTool(String),
    /// A `never(tool).until(guard)` whose guard references a step id that
    /// doesn't exist — the guard can never latch, so the tool would be
    /// forbidden forever.
    UnsatisfiableGuard {
        /// The tool the constraint gates.
        tool: String,
        /// The unknown step id the guard's `done(..)` atom references.
        step: String,
    },
    /// A cycle over the combined `after` + `before(a, b)` ordering edges —
    /// every step on the cycle waits on another, so none can ever become
    /// eligible. Contains the step ids on the cycle.
    OrderingCycle(Vec<String>),
}

impl std::fmt::Display for FlowError {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        match self {
            FlowError::Invalid(m) => write!(f, "{m}"),
            FlowError::UnreachableStep(id) => {
                write!(f, "step '{id}' is unreachable from any root")
            }
            FlowError::UnguardedCommitTool(t) => write!(
                f,
                "commit tool '{t}' is guarded by an always-true condition (effectively unguarded)"
            ),
            FlowError::UnknownTool(t) => write!(
                f,
                "flow references tool '{t}' which is not in the provided tool registry"
            ),
            FlowError::UnsatisfiableGuard { tool, step } => write!(
                f,
                "`never('{tool}').until(..)` references unknown step '{step}' — the guard can \
                 never hold, so '{tool}' would be forbidden forever"
            ),
            FlowError::OrderingCycle(steps) => write!(
                f,
                "ordering cycle across `after`/`before` edges: {} (no step on it can ever start)",
                steps.join(" -> ")
            ),
        }
    }
}

/// All problems found while compiling a [`Flow`]; non-empty on failure.
#[derive(Debug, Clone, PartialEq, Eq, Serialize)]
pub struct FlowErrors(pub Vec<FlowError>);

impl std::fmt::Display for FlowErrors {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        writeln!(f, "flow failed to compile ({} error(s)):", self.0.len())?;
        for e in &self.0 {
            writeln!(f, "  - {e}")?;
        }
        Ok(())
    }
}

impl std::error::Error for FlowErrors {}

/// The precomputed tool surface of a compiled flow: every tool name the flow
/// reasons about (step `allow`/`deny`, `once`, `never…until`, confirm), so
/// introspection can enumerate and explain gating decisions. Distinct from
/// [`tool::ToolPolicy`](crate::tool::ToolPolicy), which is a per-tool runtime
/// policy (timeout/cache/confirm).
#[derive(Debug, Clone, Default)]
pub struct ToolSurface {
    /// Every tool referenced anywhere in the flow.
    pub tools: BTreeSet<String>,
}

/// A validated [`Flow`] plus its precomputed [`ToolSurface`].
///
/// Produced by [`Flow::compile`]. Holding one is proof the flow passed
/// compilation, so the runtime never re-discovers structural errors. This is the
/// IR the conversation compiler targets and the type richer surfaces build on.
#[derive(Debug, Clone)]
pub struct CompiledFlow {
    flow: Flow,
    surface: ToolSurface,
}

impl CompiledFlow {
    /// The underlying validated flow.
    pub fn flow(&self) -> &Flow {
        &self.flow
    }
    /// The precomputed tool surface.
    pub fn tool_surface(&self) -> &ToolSurface {
        &self.surface
    }
    /// Render the flow as a Mermaid diagram.
    pub fn to_mermaid(&self) -> String {
        self.flow.to_mermaid()
    }
    /// Consume into the inner flow.
    pub fn into_flow(self) -> Flow {
        self.flow
    }
}

/// A model-readable explanation of the current control-plane state — the
/// foundation of `why did the assistant ask that?`.
///
/// Produced by [`FlowMonitor::explain`]. `Serialize` so it can be surfaced to a
/// model, a devtool, or a log without the model driving control flow.
#[derive(Debug, Clone, Serialize)]
pub struct FlowExplanation {
    /// Steps eligible-but-not-done right now.
    pub active: Vec<String>,
    /// Tools currently admitted.
    pub allowed_tools: Vec<String>,
    /// Tools currently blocked, mapped to the reason.
    pub blocked_tools: BTreeMap<String, String>,
    /// Required steps not yet done (drives repair).
    pub missing_requirements: Vec<String>,
    /// Per-active-step completion-guard truth trees: exactly which atom each
    /// stuck step is waiting on. Terminal steps (no `done` guard) are absent.
    #[serde(default, skip_serializing_if = "BTreeMap::is_empty")]
    pub active_progress: BTreeMap<String, GuardTrace>,
}

/// Builder for a [`Flow`] using the cemented verbs.
#[derive(Default)]
pub struct FlowBuilder {
    steps: Vec<Step>,
    constraints: Vec<Constraint>,
    confirm_tools: Vec<String>,
    ambient: Vec<String>,
}

impl FlowBuilder {
    fn current(&mut self) -> &mut Step {
        self.steps
            .last_mut()
            .expect("call `.step(id)` before configuring a step")
    }

    /// Declare a new step.
    pub fn step(mut self, id: impl Into<String>) -> Self {
        self.steps.push(Step {
            id: id.into(),
            after: Vec::new(),
            join: Join::default(),
            gate: None,
            done: None,
            posture: None,
            ground: None,
            allow: Vec::new(),
            deny: Vec::new(),
            terminal: false,
        });
        self
    }
    /// Add a dependency (call multiple times for multiple deps).
    pub fn after(mut self, dep: impl Into<String>) -> Self {
        self.current().after.push(Edge::to(dep));
        self
    }
    /// Add a **conditional** dependency: satisfied only while `when` holds.
    /// Conditional edges out of one source are how a flow branches; pair with
    /// [`join_any`](Self::join_any) on the merge step.
    pub fn after_when(mut self, dep: impl Into<String>, when: Guard) -> Self {
        self.current().after.push(Edge::when(dep, when));
        self
    }
    /// Any one satisfied edge makes this step eligible (the merge node after
    /// a branch). Default is `all` — a synchronizing join.
    pub fn join_any(mut self) -> Self {
        self.current().join = Join::Any;
        self
    }
    /// Extra eligibility guard beyond dependencies.
    pub fn gate(mut self, g: Guard) -> Self {
        self.current().gate = Some(g);
        self
    }
    /// Completion condition.
    pub fn done(mut self, g: Guard) -> Self {
        self.current().done = Some(g);
        self
    }
    /// Instruction imposed while active.
    pub fn posture(mut self, text: impl Into<String>) -> Self {
        self.current().posture = Some(text.into());
        self
    }
    /// A grounding template projected while active — a curated, `State`-
    /// interpolated fact line that pins the model to known values. `{key}`
    /// interpolates a value; `{key?yes:no}` picks by truthiness. See
    /// [`render_ground`].
    pub fn ground(mut self, template: impl Into<String>) -> Self {
        self.current().ground = Some(template.into());
        self
    }
    /// Tools available while active (whitelist).
    pub fn allow<I, S>(mut self, tools: I) -> Self
    where
        I: IntoIterator<Item = S>,
        S: Into<String>,
    {
        self.current()
            .allow
            .extend(tools.into_iter().map(Into::into));
        self
    }
    /// Tools forbidden while active.
    pub fn deny<I, S>(mut self, tools: I) -> Self
    where
        I: IntoIterator<Item = S>,
        S: Into<String>,
    {
        self.current()
            .deny
            .extend(tools.into_iter().map(Into::into));
        self
    }
    /// Mark the current step terminal.
    pub fn terminal(mut self) -> Self {
        self.current().terminal = true;
        self
    }

    /// A tool may run at most once.
    pub fn once(mut self, tool: impl Into<String>) -> Self {
        self.constraints.push(Constraint::Once(tool.into()));
        self
    }
    /// Ordering invariant: `a` before `b`.
    pub fn before(mut self, a: impl Into<String>, b: impl Into<String>) -> Self {
        self.constraints
            .push(Constraint::Before(a.into(), b.into()));
        self
    }
    /// Required terminal steps for completion.
    pub fn require<I, S>(mut self, steps: I) -> Self
    where
        I: IntoIterator<Item = S>,
        S: Into<String>,
    {
        self.constraints.push(Constraint::Require(
            steps.into_iter().map(Into::into).collect(),
        ));
        self
    }
    /// Exempt cross-cutting tools from every step's `allow` whitelist.
    ///
    /// Flow-level, and order-independent with respect to `.step(..)`. Use it for
    /// tools that serve the conversation rather than any one step of it —
    /// memory recall, escalation, logging. A tool named here still obeys
    /// `deny`, `once` and `never(..).until(..)`; see [`Flow::ambient`].
    ///
    /// ```
    /// # use gemini_adk_rs::flow::{Flow, Guard};
    /// let flow = Flow::new()
    ///     .ambient(["recall_context"])
    ///     .step("book")
    ///     .allow(["book_table"])
    ///     .done(Guard::called_ok("book_table"))
    ///     .build()
    ///     .unwrap();
    /// assert_eq!(flow.ambient, ["recall_context"]);
    /// ```
    pub fn ambient<I, S>(mut self, tools: I) -> Self
    where
        I: IntoIterator<Item = S>,
        S: Into<String>,
    {
        self.ambient.extend(tools.into_iter().map(Into::into));
        self
    }

    /// Un-latch `steps` whenever the guard given to
    /// [`when`](ResetBuilder::when) *becomes* true — the loop primitive.
    /// See [`Constraint::Reset`] for the exact forgiveness semantics.
    pub fn reset<I, S>(self, steps: I) -> ResetBuilder
    where
        I: IntoIterator<Item = S>,
        S: Into<String>,
    {
        ResetBuilder {
            builder: self,
            steps: steps.into_iter().map(Into::into).collect(),
        }
    }

    /// Forbid a tool until a guard holds (`never(tool).until(guard)`).
    pub fn never(self, tool: impl Into<String>) -> NeverBuilder {
        NeverBuilder {
            fb: self,
            tool: tool.into(),
        }
    }
    /// Commit-tool sugar: at most once, gated until `until`, and flagged for
    /// confirmation. Composes `once` + `never…until` + the confirmation seam.
    pub fn commit(mut self, tool: impl Into<String>, until: Guard) -> Self {
        let tool = tool.into();
        self.constraints.push(Constraint::Once(tool.clone()));
        self.constraints.push(Constraint::NeverUntil {
            tool: tool.clone(),
            until,
        });
        self.confirm_tools.push(tool);
        self
    }

    /// Finalize and validate the flow.
    pub fn build(self) -> Result<Flow, ConfigError> {
        let flow = Flow {
            steps: self.steps,
            constraints: self.constraints,
            confirm_tools: self.confirm_tools,
            ambient: self.ambient,
        };
        flow.validate()?;
        Ok(flow)
    }
}

/// Sub-builder for `never(tool).until(guard)`.
pub struct NeverBuilder {
    fb: FlowBuilder,
    tool: String,
}

impl NeverBuilder {
    /// Permit the tool once the guard holds.
    pub fn until(mut self, guard: Guard) -> FlowBuilder {
        self.fb.constraints.push(Constraint::NeverUntil {
            tool: self.tool,
            until: guard,
        });
        self.fb
    }
}

/// Intermediate for `reset(steps).when(guard)`.
pub struct ResetBuilder {
    builder: FlowBuilder,
    steps: Vec<String>,
}

impl ResetBuilder {
    /// Fire the reset on this guard's rising edge.
    pub fn when(mut self, guard: Guard) -> FlowBuilder {
        self.builder.constraints.push(Constraint::Reset {
            steps: self.steps,
            when: guard,
        });
        self.builder
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use serde_json::json;

    /// A refusal must say what would succeed, not only what failed.
    ///
    /// The old message was "'X' is not available in the current step" — the
    /// tool's own name and nothing else. The model cannot act on that: it knows
    /// the call was rejected but not what the gate is holding out for, so it
    /// guesses. In the governed collections evaluation it guessed identity
    /// verification and re-asked a caller it had already verified for their card
    /// digits, which read as the model losing the tool result when in fact the
    /// gate had told it nothing.
    #[test]
    fn a_refusal_names_what_is_available_instead() {
        let state = State::new();
        let mon = FlowMonitor::new(debt_flow(), Enforcement::Enforce);

        let reason = mon
            .admits_tool("charge_card", &state)
            .expect_err("charge_card is gated behind verification");

        assert!(
            reason.contains("lookup_account"),
            "a refusal must point at the tool that would make progress: {reason}"
        );
        assert!(
            reason.contains("ptp_confirmed"),
            "a refusal must name the condition it is waiting on: {reason}"
        );
    }

    /// The step's own posture rides along, so the reason and the redirection
    /// arrive in one payload rather than the model having to reconcile an error
    /// with steering sent on an earlier turn.
    #[test]
    fn a_refusal_carries_the_active_steps_posture() {
        let state = State::new();
        let mon = FlowMonitor::new(debt_flow(), Enforcement::Enforce);

        let reason = mon
            .admits_tool("charge_card", &state)
            .expect_err("charge_card is gated behind verification");

        assert!(
            reason.contains("Verify the caller's identity."),
            "the active step's posture belongs in the refusal: {reason}"
        );
    }

    /// A spent `once` is the one refusal with nothing to redirect to: the answer
    /// is "you already did this", and offering alternatives would invite a
    /// retry under another name.
    #[test]
    fn a_spent_once_constraint_does_not_offer_alternatives() {
        let state = State::new();
        let flow = Flow::new()
            .step("pay")
            .allow(["charge_card"])
            .done(Guard::called_ok("charge_card"))
            .once("charge_card")
            .build()
            .expect("valid flow");
        let mut mon = FlowMonitor::new(flow, Enforcement::Enforce);
        mon.on_tool_ok("charge_card", &state);

        let reason = mon
            .admits_tool("charge_card", &state)
            .expect_err("once is spent");

        assert!(
            reason.contains("already run"),
            "a spent `once` must say so plainly: {reason}"
        );
        assert!(
            !reason.contains("Available now"),
            "nothing to redirect to — offering a menu invites a retry: {reason}"
        );
    }

    /// The redirection is computed against live state, so it changes as the
    /// conversation progresses rather than describing the flow's opening move
    /// forever.
    #[test]
    fn the_redirection_tracks_the_conversation() {
        let state = State::new();
        let mon = FlowMonitor::new(debt_flow(), Enforcement::Enforce);

        let before = mon
            .admits_tool("charge_card", &state)
            .expect_err("gated before the promise is confirmed");
        assert!(
            before.contains("ptp_confirmed") && before.contains("lookup_account"),
            "{before}"
        );

        // Verification lands and the call moves on to the disclosure step. The
        // same constraint still blocks `charge_card`, but where the caller *is*
        // has changed, and the refusal has to change with it.
        let _ = state.set("identity_verified", true);
        let mut mon = mon;
        mon.on_turn(&state);
        let after = mon
            .admits_tool("charge_card", &state)
            .expect_err("the promise is still unconfirmed");

        assert!(
            after.contains("Give the disclosure."),
            "the refusal must carry the posture of the step that is now active, \
             not the one that was active when the session opened: {after}"
        );
        assert!(
            !after.contains("Verify the caller's identity."),
            "a completed step's posture must not keep riding along on refusals — \
             that is how a verified caller gets asked to verify again: {after}"
        );
        assert_ne!(
            before, after,
            "the refusal did not change when the flow advanced"
        );
    }

    /// Guard prose is what makes a refusal legible; pinned so the atoms do not
    /// silently start rendering as debug output.
    #[test]
    fn guards_describe_themselves_in_prose() {
        assert_eq!(
            Guard::is_true("verified").describe(),
            "'verified' must be true"
        );
        assert_eq!(
            Guard::captured(["amount", "date"]).describe(),
            "these must be known: amount, date"
        );
        assert_eq!(
            Guard::called_ok("disclose").describe(),
            "'disclose' must have run successfully"
        );
        assert_eq!(
            Guard::all([Guard::is_true("a"), Guard::done("b")]).describe(),
            "'a' must be true and step 'b' must be complete"
        );
        assert_eq!(
            Guard::custom(|_| true).describe(),
            "a condition set by the application",
            "a custom guard has no readable spec, and must not pretend otherwise"
        );
    }

    fn debt_flow() -> Flow {
        Flow::new()
            .step("verify")
            .posture("Verify the caller's identity.")
            .allow(["lookup_account"])
            .done(Guard::is_true("identity_verified"))
            .step("disclose")
            .after("verify")
            .posture("Give the disclosure.")
            .done(Guard::is_true("disclosure_given"))
            .step("capture_ptp")
            .after("disclose")
            .done(Guard::captured(["ptp_amount", "ptp_date"]))
            .step("take_payment")
            .after("capture_ptp")
            .allow(["charge_card"])
            .done(Guard::called_ok("charge_card"))
            .step("close")
            .after("capture_ptp")
            .terminal()
            .never("charge_card")
            .until(Guard::is_true("ptp_confirmed"))
            .once("charge_card")
            .require(["close"])
            .build()
            .expect("valid flow")
    }

    #[test]
    fn validates_and_detects_unknown_dep() {
        let bad = Flow::new()
            .step("a")
            .done(Guard::is_true("x"))
            .step("b")
            .after("missing")
            .terminal()
            .build();
        assert!(bad.is_err());
    }

    #[test]
    fn detects_cycle() {
        // a after b, b after a — build() should reject.
        let steps = vec![
            Step {
                id: "a".into(),
                after: vec!["b".into()],
                join: Join::default(),
                gate: None,
                done: Some(Guard::always()),
                posture: None,
                ground: None,
                allow: vec![],
                deny: vec![],
                terminal: false,
            },
            Step {
                id: "b".into(),
                after: vec!["a".into()],
                join: Join::default(),
                gate: None,
                done: Some(Guard::always()),
                posture: None,
                ground: None,
                allow: vec![],
                deny: vec![],
                terminal: false,
            },
        ];
        let flow = Flow {
            steps,
            ..Flow::default()
        };
        assert!(flow.validate().is_err());
    }

    #[test]
    fn marking_latches_in_order() {
        let flow = debt_flow();
        let mut mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();

        // Nothing done; only `verify` is active.
        assert_eq!(
            mon.active_steps(&state)
                .iter()
                .map(|s| s.id.as_str())
                .collect::<Vec<_>>(),
            vec!["verify"]
        );

        let _ = state.set("identity_verified", true);
        mon.on_turn(&state);
        assert!(mon.marking().done.contains("verify"));
        assert_eq!(mon.verdict("verify", &state), Verdict::Done);
        assert_eq!(mon.verdict("disclose", &state), Verdict::Active);

        let _ = state.set("disclosure_given", true);
        let _ = state.set("ptp_amount", 200);
        let _ = state.set("ptp_date", "2026-06-05");
        mon.on_turn(&state);
        // disclose + capture_ptp latch; close is terminal+eligible -> done.
        assert!(mon.marking().done.contains("capture_ptp"));
        assert!(mon.marking().done.contains("close"));
        assert!(mon.is_complete());
    }

    #[test]
    fn enforces_never_until_and_once() {
        let flow = debt_flow();
        let mut mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();
        // get to take_payment being active
        let _ = state.set("identity_verified", true);
        let _ = state.set("disclosure_given", true);
        let _ = state.set("ptp_amount", 200);
        let _ = state.set("ptp_date", "x");
        mon.on_turn(&state);

        // charge_card blocked until ptp_confirmed.
        assert!(mon.admits_tool("charge_card", &state).is_err());
        let _ = state.set("ptp_confirmed", true);
        assert!(mon.admits_tool("charge_card", &state).is_ok());

        // after it succeeds once, `once` blocks a second call.
        mon.on_tool_ok("charge_card", &state);
        assert!(mon.admits_tool("charge_card", &state).is_err());
    }

    #[test]
    fn whitelist_scopes_tools_to_active_step() {
        let flow = debt_flow();
        let mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();
        // In `verify`, only lookup_account is allowed.
        assert!(mon.admits_tool("lookup_account", &state).is_ok());
        assert!(mon.admits_tool("charge_card", &state).is_err());
    }

    #[test]
    fn observe_mode_records_violations_not_blocks() {
        let flow = debt_flow();
        let mut mon = FlowMonitor::new(flow, Enforcement::Observe);
        let state = State::new();
        // charge_card out of order in observe mode -> recorded, still "runs".
        mon.observe_tool("charge_card", true, &state);
        assert_eq!(mon.violations().len(), 1);
        assert_eq!(mon.violations()[0].subject, "charge_card");
    }

    #[test]
    fn compile_accepts_valid_flow_and_collects_tool_universe() {
        let compiled = debt_flow().compile().expect("valid flow compiles");
        // Tool universe spans allow/deny/once/never_until/confirm.
        assert!(compiled.tool_surface().tools.contains("charge_card"));
        assert!(compiled.tool_surface().tools.contains("lookup_account"));
        let _ = FlowMonitor::compiled(compiled, Enforcement::Enforce);
    }

    #[test]
    fn compile_rejects_unreachable_step() {
        // `orphan` has no `after` and nothing leads to it — but it IS a root, so
        // to make it unreachable we give it an `after` on a step, then never make
        // that path lead anywhere. Simplest: a step depending on a missing root is
        // caught by validate; here we test a step unreachable via a broken chain.
        let flow = Flow::new()
            .step("a")
            .done(Guard::is_true("a_done"))
            .step("b")
            .after("a")
            .done(Guard::is_true("b_done"))
            .step("island")
            .after("b")
            .gate(Guard::is_true("never"))
            .terminal()
            .build()
            .expect("structurally valid");
        // island is reachable via a->b->island, so this compiles; assert it does.
        assert!(flow.compile().is_ok());
    }

    #[test]
    fn compile_rejects_unguarded_commit_tool() {
        // commit tool gated by an always-true guard is effectively unguarded.
        let flow = Flow::new()
            .step("s")
            .allow(["pay"])
            .done(Guard::called_ok("pay"))
            .terminal()
            .commit("pay", Guard::always())
            .build()
            .expect("structurally valid");
        let err = flow
            .compile()
            .expect_err("unguarded commit must fail to compile");
        assert!(
            err.0
                .iter()
                .any(|e| matches!(e, FlowError::UnguardedCommitTool(t) if t == "pay"))
        );
    }

    #[test]
    fn compile_with_tools_accepts_a_covering_registry() {
        let compiled = debt_flow()
            .compile_with_tools(&["lookup_account", "charge_card", "unrelated_extra"])
            .expect("registry covers the flow's tool universe");
        assert!(compiled.tool_surface().tools.contains("charge_card"));
    }

    #[test]
    fn compile_with_tools_reports_dangling_tool_names() {
        // `charge_card` is referenced (allow/once/never_until) but missing from
        // the registry — a typo/drift the compiler must catch.
        let err = debt_flow()
            .compile_with_tools(&["lookup_account"])
            .expect_err("dangling tool must fail to compile");
        assert!(
            err.0
                .iter()
                .any(|e| matches!(e, FlowError::UnknownTool(t) if t == "charge_card"))
        );
        // Plain compile() stays registry-agnostic.
        assert!(debt_flow().compile().is_ok());
    }

    #[test]
    fn compile_rejects_never_until_guard_on_unknown_step() {
        // `never(pay).until(done("missing"))` can never latch — `pay` would be
        // forbidden forever. validate() doesn't check constraint guards; compile must.
        let flow = Flow::new()
            .step("s")
            .allow(["pay"])
            .done(Guard::called_ok("pay"))
            .never("pay")
            .until(Guard::done("missing"))
            .build()
            .expect("structurally valid for build()");
        let err = flow.compile().expect_err("unsatisfiable guard must fail");
        assert!(err.0.iter().any(|e| matches!(
            e,
            FlowError::UnsatisfiableGuard { tool, step } if tool == "pay" && step == "missing"
        )));
    }

    #[test]
    fn compile_rejects_before_cycle() {
        // `after` edges are acyclic, but before(a, b) + before(b, a) closes an
        // ordering cycle: neither step can ever become eligible. validate()'s
        // cycle check only walks `after`, so compile must catch this.
        let flow = Flow::new()
            .step("a")
            .done(Guard::is_true("a_done"))
            .step("b")
            .done(Guard::is_true("b_done"))
            .before("a", "b")
            .before("b", "a")
            .build()
            .expect("build() only checks `after` cycles");
        let err = flow
            .compile()
            .expect_err("before-cycle must fail to compile");
        assert!(err.0.iter().any(|e| matches!(
            e,
            FlowError::OrderingCycle(steps)
                if steps.contains(&"a".to_string()) && steps.contains(&"b".to_string())
        )));
    }

    #[test]
    fn explain_reports_blocked_tools_and_reasons() {
        let flow = debt_flow();
        let mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();
        let ex = mon.explain(&state);
        // In the initial `verify` step, charge_card is blocked; explain says so.
        assert!(ex.blocked_tools.contains_key("charge_card"));
        assert!(ex.active.contains(&"verify".to_string()));
    }

    #[test]
    fn before_constraint_gates_step_eligibility() {
        // Regression: `before(a, b)` was validated but never enforced — `b` could
        // start before `a` was done. `a` and `b` have no `after` edge, so only the
        // Before constraint orders them.
        let flow = Flow::new()
            .step("a")
            .done(Guard::is_true("a_done"))
            .step("b")
            .done(Guard::is_true("b_done"))
            .before("a", "b")
            .build()
            .expect("valid flow");
        let mut mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();

        // `b` is NOT active until `a` is done, even though its own gate is open.
        let active: Vec<String> = mon
            .active_steps(&state)
            .iter()
            .map(|s| s.id.clone())
            .collect();
        assert!(active.contains(&"a".to_string()));
        assert!(
            !active.contains(&"b".to_string()),
            "b must wait for a (Before)"
        );

        let _ = state.set("a_done", true);
        mon.on_turn(&state);
        let active: Vec<String> = mon
            .active_steps(&state)
            .iter()
            .map(|s| s.id.clone())
            .collect();
        assert!(active.contains(&"b".to_string()), "b active once a is done");
    }

    #[test]
    fn custom_guard_in_combinator_is_not_erased() {
        // Regression: a custom guard nested in all()/any() was lowered to
        // Pred::Always, silently deleting it. It must still evaluate.
        let always_false = Guard::all([Guard::is_true("present"), Guard::custom(|_| false)]);
        // Mixed combinator is a Custom guard (non-serializable), not a Spec.
        assert!(matches!(always_false, Guard::Custom(_)));

        let state = State::new();
        let _ = state.set("present", true);
        let marking = Marking::default();
        let ctx = FlowCtx {
            state: &state,
            marking: &marking,
        };
        // Would be `true` if the custom guard had been erased to Always.
        assert!(!always_false.eval(&ctx), "custom guard must still veto");

        // all-spec combinator stays serializable.
        let serializable = Guard::all([Guard::is_true("a"), Guard::is_set("b")]);
        assert!(matches!(serializable, Guard::Spec(_)));
    }

    #[test]
    fn serde_round_trips_data_driven_flow() {
        let flow = debt_flow();
        let jsonv = serde_json::to_value(&flow).expect("serialize");
        let back: Flow = serde_json::from_value(jsonv).expect("deserialize");
        back.validate().expect("round-tripped flow is valid");
        assert_eq!(back.steps.len(), flow.steps.len());
    }

    #[test]
    fn custom_guard_is_not_serializable() {
        let flow = Flow::new()
            .step("a")
            .done(Guard::custom(|ctx| ctx.state.contains("ready")))
            .terminal()
            .build()
            .unwrap();
        assert!(serde_json::to_value(&flow).is_err());
    }

    #[test]
    fn mermaid_export_has_nodes_and_edges() {
        let m = debt_flow().to_mermaid();
        assert!(m.contains("flowchart TD"));
        assert!(m.contains("verify --> disclose"));
        assert!(m.contains("close([close])")); // terminal shape
    }

    struct WriteAgent;
    #[async_trait::async_trait]
    impl TextAgent for WriteAgent {
        fn name(&self) -> &str {
            "writer"
        }
        async fn run(&self, _state: &State) -> Result<String, crate::error::AgentError> {
            Ok("available".to_string())
        }
    }

    #[tokio::test]
    async fn on_enter_fires_once_when_step_activates() {
        // collect -> check ; `check` runs an agent on enter whose result
        // (`check:result`) then completes a downstream `book` step.
        let flow = Flow::new()
            .step("collect")
            .done(Guard::is_true("collected"))
            .step("check")
            .after("collect")
            .done(Guard::resolved("check"))
            .step("book")
            .after("check")
            .terminal()
            .require(["book"])
            .build()
            .expect("valid flow");

        let mut mon = FlowMonitor::new(flow, Enforcement::Enforce)
            .on_enter("check", on_enter(Arc::new(WriteAgent), AgentMode::Call));
        let state = State::new();

        // Only `collect` is active at the start.
        assert_eq!(mon.take_newly_active(&state), vec!["collect".to_string()]);
        // Re-asking yields nothing — fire-once.
        assert!(mon.take_newly_active(&state).is_empty());

        // Complete `collect`; `check` becomes active and its on_enter fires.
        let _ = state.set("collected", true);
        mon.on_turn(&state);
        mon.fire_enter_actions(&state).await;
        assert_eq!(
            state.get::<String>("check:result").as_deref(),
            Some("available")
        );

        // The resolved result completes `check`, then terminal `book`.
        mon.on_turn(&state);
        assert!(mon.marking().done.contains("check"));
        assert!(mon.is_complete());
        // No further newly-active steps to announce.
        assert!(mon.take_newly_active(&state).is_empty());
    }

    #[test]
    fn ground_template_interpolates_and_branches() {
        let state = State::new();
        let _ = state.set("when", "3pm");
        let _ = state.set("available", true);
        let _ = state.set("prior_visits", 2);
        assert_eq!(
            render_ground(
                "{when} is {available?open:taken}; {prior_visits} prior visits.",
                &state
            ),
            "3pm is open; 2 prior visits."
        );
        // Falsy branch + absent key renders empty.
        let _ = state.set("available", false);
        assert_eq!(
            render_ground("slot {missing}is {available?free:full}", &state),
            "slot is full"
        );
    }

    #[test]
    fn active_grounds_projects_only_active_steps() {
        let flow = Flow::new()
            .step("collect")
            .ground("Known time: {when}.")
            .done(Guard::is_set("when"))
            .step("done")
            .after("collect")
            .terminal()
            .build()
            .expect("valid flow");
        let mut mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();
        let _ = state.set("when", "3pm");
        assert_eq!(
            mon.active_grounds(&state),
            vec!["Known time: 3pm.".to_string()]
        );
        // Once collect completes, its ground no longer projects.
        mon.on_turn(&state);
        assert!(mon.active_grounds(&state).is_empty());
    }

    #[test]
    fn eq_guard_matches_state_value() {
        let g = Guard::eq("status", json!("active"));
        let state = State::new();
        let marking = Marking::default();
        assert!(!g.eval(&FlowCtx {
            state: &state,
            marking: &marking
        }));
        let _ = state.set("status", "active");
        assert!(g.eval(&FlowCtx {
            state: &state,
            marking: &marking
        }));
    }

    // ─── ambient tools ──────────────────────────────────────────────────────
    //
    // A step's `allow` list is a whitelist, so it excludes by omission: every
    // tool the author did not think to name is denied for the duration. That is
    // right for domain tools — naming `charge_card` is a statement that this is
    // the step where money moves — and wrong for cross-cutting infrastructure
    // that no step is *about*. Memory recall is the motivating case: a flow
    // author writing `.allow(["book_table"])` is saying "book here, don't search
    // the catalogue", not "stop remembering who the caller is".
    //
    // `ambient` names those tools once, at flow level. They are exempt from the
    // whitelist's implicit exclusion and from nothing else: a constraint that
    // *names* the tool still binds, because naming it is a deliberate act.

    fn ambient_flow() -> Flow {
        Flow::new()
            .ambient(["recall_context"])
            .step("gather")
            .allow(["ask_diet"])
            .done(Guard::is_set("user:diet"))
            .step("book")
            .after("gather")
            .allow(["book_table"])
            .done(Guard::called_ok("book_table"))
            .build()
            .expect("flow is structurally valid")
    }

    #[test]
    fn an_ambient_tool_survives_a_step_whitelist() {
        let mon = FlowMonitor::new(ambient_flow(), Enforcement::Enforce);
        let state = State::new();
        assert_eq!(
            mon.admits_tool("ask_diet", &state),
            Ok(()),
            "the step's own tool is admitted"
        );
        assert!(
            mon.admits_tool("book_table", &state).is_err(),
            "a later step's tool is still excluded by `gather`'s whitelist"
        );
        assert_eq!(
            mon.admits_tool("recall_context", &state),
            Ok(()),
            "an ambient tool must not be caught by a whitelist that never meant to exclude it"
        );
    }

    #[test]
    fn an_ambient_tool_is_still_denied_when_a_step_names_it() {
        // `deny` names the tool, so it is a decision about that tool rather than
        // a side effect of listing others. Ambient must not override it.
        let flow = Flow::new()
            .ambient(["recall_context"])
            .step("sensitive")
            .deny(["recall_context"])
            .done(Guard::is_true("done"))
            .build()
            .expect("flow is structurally valid");
        let mon = FlowMonitor::new(flow, Enforcement::Enforce);
        assert!(
            mon.admits_tool("recall_context", &State::new()).is_err(),
            "an explicit `deny` outranks ambient"
        );
    }

    #[test]
    fn an_ambient_tool_still_obeys_never_until() {
        let flow = Flow::new()
            .ambient(["manage_memory"])
            .step("verify")
            .done(Guard::is_true("verified"))
            .never("manage_memory")
            .until(Guard::is_true("verified"))
            .build()
            .expect("flow is structurally valid");
        let mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();
        assert!(
            mon.admits_tool("manage_memory", &state).is_err(),
            "`never(..).until(..)` names the tool; ambient must not unlock it"
        );
        let _ = state.set("verified", true);
        assert_eq!(
            mon.admits_tool("manage_memory", &state),
            Ok(()),
            "once the guard holds the constraint stops binding"
        );
    }

    #[test]
    fn an_ambient_tool_still_obeys_once() {
        let flow = Flow::new()
            .ambient(["summarize"])
            .step("work")
            .done(Guard::called_ok("summarize"))
            .once("summarize")
            .build()
            .expect("flow is structurally valid");
        let mut mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();
        assert_eq!(mon.admits_tool("summarize", &state), Ok(()));
        mon.observe_tool("summarize", true, &state);
        assert!(
            mon.admits_tool("summarize", &state).is_err(),
            "`once` names the tool; ambient must not exempt it"
        );
    }

    #[test]
    fn ambient_tools_join_the_tool_universe() {
        // Otherwise `compile_with_tools` would report a registry that covers the
        // flow as complete while an ambient tool it never heard of gets called.
        let flow = ambient_flow();
        assert!(
            flow.tool_universe().contains("recall_context"),
            "an ambient tool is part of the flow's tool universe"
        );
        assert!(
            ambient_flow()
                .compile_with_tools(&["ask_diet", "book_table"])
                .is_err(),
            "a registry missing the ambient tool must not compile clean"
        );
        assert!(
            ambient_flow()
                .compile_with_tools(&["ask_diet", "book_table", "recall_context"])
                .is_ok(),
            "a covering registry compiles"
        );
    }

    #[test]
    fn a_flow_with_no_ambient_tools_is_unchanged() {
        // The whole point is that this is additive: a flow that never mentions
        // `ambient` must gate exactly as it did before the field existed.
        let mon = FlowMonitor::new(debt_flow(), Enforcement::Enforce);
        let state = State::new();
        assert_eq!(mon.admits_tool("lookup_account", &state), Ok(()));
        assert!(mon.admits_tool("charge_card", &state).is_err());
        assert!(mon.admits_tool("anything_else", &state).is_err());
    }

    #[test]
    fn explain_trace_reports_per_atom_truth() {
        let state = State::new();
        let _ = state.set("ptp_amount", 200);
        let marking = Marking::default();
        let ctx = FlowCtx {
            state: &state,
            marking: &marking,
        };
        let guard = Guard::all([
            Guard::captured(["ptp_amount", "ptp_date"]),
            Guard::is_true("confirmed"),
        ]);
        let trace = guard.explain_trace(&ctx);
        assert!(!trace.holds);
        assert_eq!(trace.desc, "all of");
        assert_eq!(trace.children.len(), 2);
        // `captured` is a single atom (one node); `is_true` is false.
        assert!(!trace.children[0].holds, "ptp_date missing");
        assert!(!trace.children[1].holds);
        // JSON-serializable for devtools.
        assert!(serde_json::to_value(&trace).is_ok());
    }

    #[test]
    fn explanation_carries_active_step_progress() {
        let mon = FlowMonitor::new(debt_flow(), Enforcement::Enforce);
        let state = State::new();
        let ex = mon.explain(&state);
        let verify = ex.active_progress.get("verify").expect("verify is active");
        assert!(!verify.holds);
        assert!(verify.desc.contains("identity_verified"));
    }

    #[test]
    fn state_keys_read_covers_guards_and_constraints() {
        let keys = debt_flow().state_keys_read();
        for k in [
            "identity_verified",
            "disclosure_given",
            "ptp_amount",
            "ptp_date",
        ] {
            assert!(keys.contains(k), "missing read key {k}");
        }
        // Tool/step references are not state keys.
        assert!(!keys.contains("charge_card"));
    }

    #[test]
    fn posture_updates_take_effect_in_place() {
        let mut mon = FlowMonitor::new(debt_flow(), Enforcement::Enforce);
        let state = State::new();
        assert!(mon.set_posture("verify", Some("New posture.".into())));
        assert!(!mon.set_posture("no_such_step", None));
        assert_eq!(
            mon.active_postures(&state),
            vec!["New posture.".to_string()]
        );
    }

    #[test]
    fn eval_state_treats_marking_atoms_as_false() {
        let state = State::new();
        let _ = state.set("ready", true);
        assert!(Guard::is_true("ready").eval_state(&state));
        assert!(!Guard::called_ok("any_tool").eval_state(&state));
    }

    #[test]
    fn conditional_edges_branch_and_any_join_merges() {
        // decide ─(routine)→ schedule ─┐
        //        ─(emergency)→ escalate ─┴→ close (join: any)
        let flow = Flow::new()
            .step("decide")
            .done(Guard::is_set("severity"))
            .step("schedule")
            .after_when("decide", Guard::eq("severity", "routine"))
            .done(Guard::called_ok("book"))
            .allow(["book"])
            .step("escalate")
            .after_when("decide", Guard::eq("severity", "emergency"))
            .done(Guard::called_ok("transfer"))
            .allow(["transfer"])
            .step("close")
            .after("schedule")
            .after("escalate")
            .join_any()
            .terminal()
            .build()
            .expect("valid");
        let mut mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();
        let _ = state.set("severity", "routine");
        mon.relatch(&state);
        let active: Vec<String> = mon.explain(&state).active;
        assert!(
            active.contains(&"schedule".to_string()),
            "routine branch opens"
        );
        assert!(
            !active.contains(&"escalate".to_string()),
            "emergency branch stays closed"
        );
        // Merge via any-join: schedule alone completing closes the flow.
        mon.on_tool_ok("book", &state);
        assert!(mon.marking().done.contains("close"), "any-join merged");
    }

    #[test]
    fn reset_unlatches_on_rising_edge_and_forgives_called_ok() {
        let flow = Flow::new()
            .step("pay")
            .allow(["charge"])
            .done(Guard::called_ok("charge"))
            .once("charge")
            .reset(["pay"])
            .when(Guard::is_true("declined"))
            .build()
            .expect("valid");
        let mut mon = FlowMonitor::new(flow, Enforcement::Enforce);
        let state = State::new();
        mon.relatch(&state);
        mon.on_tool_ok("charge", &state);
        assert!(mon.marking().done.contains("pay"));
        assert!(mon.admits_tool("charge", &state).is_err(), "once spent");

        // Decline: rising edge un-latches pay and forgives the charge.
        let _ = state.set("declined", true);
        mon.relatch(&state);
        assert!(!mon.marking().done.contains("pay"), "un-latched");
        assert!(
            mon.admits_tool("charge", &state).is_ok(),
            "once counts per latch-cycle"
        );

        // Still-true guard does not re-fire (edge, not level).
        mon.on_tool_ok("charge", &state);
        mon.relatch(&state);
        assert!(
            mon.marking().done.contains("pay"),
            "second charge latches again"
        );
    }

    #[test]
    fn edge_serde_keeps_plain_strings_and_round_trips_conditions() {
        let flow = Flow::new()
            .step("a")
            .terminal()
            .step("b")
            .after("a")
            .after_when("a", Guard::is_true("x"))
            .join_any()
            .terminal()
            .build()
            .expect("valid");
        let json = serde_json::to_value(&flow).expect("serialize");
        // Unconditional edge stays the original plain string.
        assert_eq!(json["steps"][1]["after"][0], serde_json::json!("a"));
        assert_eq!(
            json["steps"][1]["after"][1],
            serde_json::json!({"step": "a", "when": {"is_true": "x"}})
        );
        assert_eq!(json["steps"][1]["join"], serde_json::json!("any"));
        let back: Flow = serde_json::from_value(json).expect("deserialize");
        assert_eq!(back.steps[1].after.len(), 2);
        assert!(back.steps[1].after[1].when.is_some());
    }

    #[test]
    fn flow_json_schema_generates() {
        let schema = serde_json::to_value(schemars::schema_for!(Flow)).expect("schema");
        let text = schema.to_string();
        // The Guard schema must surface the Pred atoms.
        assert!(text.contains("is_true"));
        assert!(text.contains("never_until"));
    }
}