Frozen copy of the Vultron Protocol Specification draft-1, as released in v2026.11.0: commit 1ae1bda2cf7e4f6b2f66b954f9f28256c595a4d8, built 2026-11-13 (UTC). These pages never change. Their links that leave the specification go to the live site, which changes.

Skip to content
Reference

Annex C Notation Reference

The whole specification on one page

The specification is also published as a single page that holds every section and annex in order, for printing or for searching the whole text at once.

This page holds informative Annex C of the Vultron Protocol Specification: the mathematical and diagram notation of the formal treatment, and the notation for writing a Wire Activity. It includes the symbols of each Deterministic Finite Automaton (DFA) the formal treatment defines.

Annex C — Notation Reference [I]

The conventions this specification uses for state names and case-state notation are stated at §1.4 Document Conventions. This annex collects the mathematical and diagram notation used in the formal treatment, and the notation for writing a Wire Activity.

Mathematical Notation

All of these definitions assume the standard Zermelo-Fraenkel set theory. The following notation is used:

Set Theory Symbols

Symbol Meaning
\(\{ \dots \}\) depending on the context: (1) an ordered set in which the items occur in that sequence, or (2) a tuple of values
|\(x\)| the count of the number of elements in a list, set, tuple, or vector \(x\)
\(\subset,=,\subseteq\) the normal proper subset, equality, and subset relations between sets
\(\in\) the membership (is-in) relation between an element and the set it belongs to
\(\prec\) the precedes relation on members of an ordered set: \(\sigma_i \prec \sigma_j \textrm{ if and only if } \sigma_i,\sigma_j \in s \textrm{ and } i < j\) where \(s\) is an ordered set
|\(X\)| the size of (the number of elements in) a set \(X\)
\(\langle X_i \rangle^N_{i=1}\) a set of \(N\) sets \(X_i\), indexed by \(i\); used in the Formal Protocol in the context of Communicating Finite State Machines, taken from the article On Communicating Finite State Machines by Brand and Zafiropulo

Logic Symbols

Symbol Meaning
\(\implies\) implies
\(\iff\) if-and-only-if (bi-directional implication)
\(\wedge\) the logical AND operator
\(\lnot\) the logical NOT operator

Directional Messaging Symbols

Symbol Meaning
\(\rightharpoonup{}\) a message emitted (sent) by a process
\(\leftharpoondown{}\) a message received by a process

DFA Symbols

Symbol Meaning
\(\xrightarrow{}\) a transition between states, usually labeled with the transition type (e.g., \(\xrightarrow{a}\))
\((\mathcal{Q},q_0,\mathcal{F},\Sigma,\delta)\) specific symbols for individual DFA components that are introduced when needed in Chapters
\(\Big \langle { \langle S_i \rangle }^N_{i=1}, { \langle o_i \rangle }^N_{i=1}, { \langle M_{i,j} \rangle}^N_{i,j=1}, { succ } \Big \rangle\) formal protocol symbols that are introduced at the beginning of the Formal Protocol

Diagram Notation

A variety of diagramming techniques are used throughout the documentation.

State Diagrams

Depictions of DFA as figures use common state diagram symbols, as shown in the example below.

stateDiagram-v2
    direction LR
    [*] --> q0
    q0 --> q1 : a
    q0 --> q2 : b
    q1 --> q2 : a
    q1 --> q1 : b
    q2 --> q0 : a
    q2 --> q1 : b
    q2 --> [*]

Sequence and Class Diagrams

Sequence and class diagrams follow Unified Modeling Language (UML) conventions

---
title: Sequence Diagram Example
---
sequenceDiagram
    participant A as Alice
    participant B as Bob
    A ->> B: Authentication Request
    B->>A: Authentication Response
---
title: Class Diagram Example
---
classDiagram
    Class01 <|-- Class02
    Class03 *-- Class04
    Class05 o-- Class06
    Class07 .. Class08

Behavior Tree Diagrams

A few additional notation details specific to Behavior Trees are introduced when needed.

Wire Activity Notation

A Wire Activity is an ActivityStreams 2.0 (AS2) activity of a given shape. This specification and the documentation write one as Verb(Object)[field=Value].

  • Verb. The activity's own AS2 type comes first: Offer, Accept, Add.
  • Object in parentheses. The parentheses hold the type of the activity's object: Offer(VulnerabilityReport) is an Offer whose object is a VulnerabilityReport.
  • Nesting. When the object is itself an activity, the parentheses hold that activity in the same notation: Accept(Offer(VulnerabilityReport)) is an Accept whose object is an Offer of a VulnerabilityReport.
  • Bracketed fields. Brackets after an activity name its other fields that tell occasions apart, each as field=Value, with a comma between two of them. The brackets qualify the activity they follow: in Add(CaseStatus)[target=VulnerabilityCase] the target is the Add's, and in Accept(Invite(EmbargoEvent)[context=VulnerabilityCase]) the context is the Invite's. A value is the type the field holds, or a literal value such as a state name. Written without its brackets, as Invite(EmbargoEvent), an activity names every occasion of that shape. A field that tells no occasions apart is described in the surrounding text, not in the notation.
  • Type names. Each name is the type value the sender puts on the wire, AS2 or Vultron extension (such as EmbargoEvent), never the name of a class in an implementation. An embargo is sent with type EmbargoEvent, so the notation writes Invite(EmbargoEvent), Remove(EmbargoEvent) and Create(EmbargoEvent).
  • No addressing. The notation describes the activity's shape, not where it goes. Recipients, roles and the sender are never written in it; an occasion table gives them in its "Send to" and "Sent by" columns (Message Types).

A known defect in the reference implementation

The reference implementation currently also accepts a plain AS2 Event where an embargo is expected. This is a defect tracked in #5155, and a sender cannot rely on it.

A Wire Activity is the shape a sender puts on the wire. It does not name a formal protocol message: the Protocol Shorthand, such as RS or EP, does.