Papers
Topics
Authors
Recent
Search
2000 character limit reached

Boldsea Engine: Ontology-Driven Workflow

Updated 4 April 2026
  • Boldsea Engine is an event-driven system that formalizes subject-event ontologies with deterministic, acyclic causal graphs.
  • It employs an append-only event store, unified model repository, and BSL-based guard evaluation for model-driven event validation.
  • The engine supports multiperspectivity in distributed asynchronous domains, with applications in microservices, DLT, IoT, and collaborative editing.

The Boldsea Engine is an event-driven workflow and ontology execution system that realizes a formal subject-event ontology without reliance on global time. It interprets subjectively fixed events through epistemically constrained models and deterministic dataflow, ensuring monotonic, acyclic causal histories for distributed, asynchronous, and multiperspective domains. The foundational principles and execution architecture are detailed in (Boldachev, 20 Oct 2025) and (Boldachev, 11 Sep 2025), establishing both the theoretical and practical semantics of executable ontologies in the Boldsea framework.

1. Formal Foundations: Subject-Event Ontology and Causality

The Boldsea Engine operationalizes a subject-event ontology predicated on the concept of event fixation by epistemic subjects (actors). An event is formalized as an atomic act of discernment by a subject, subject to the epistemic constraints of a reference model. Formally, an event is represented as

Event{id:ID,  actor:Actor,  role?:Role,  key:Key,  payload:Payload,  refs?:Set(EventID)}\text{Event} \coloneqq \{ \text{id} : \text{ID},\; \text{actor} : \text{Actor},\; \text{role}? : \text{Role},\; \text{key} : \text{Key},\; \text{payload} : \text{Payload},\; \text{refs}? : \mathrm{Set}(\text{EventID}) \}

with Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context} partitioning event history HH into independent channels HkH_k. Models function as epistemic filters, defining which events can be fixed based on schema, permissions, and conditionality. The core causal order is established not by timestamps but by the transitive closure of explicit references:

hb:=tc(refs)\text{hb} := \mathrm{tc}(\mathrm{refs})

where the "happens-before" relation arises only from the explicit causal graph, ensuring acyclicity and traceability without global clocks (Boldachev, 20 Oct 2025).

2. Engine Architecture and Execution Semantics

The engine maintains an append-only event store and a unified model repository, forming the backbone of the execution semantics. Major components include:

  • Event Store: Append-only, partitioned by keys.
  • Model Repository: Stores models with schema, permissions, and conditions.
  • Guard Engine: Evaluates Boldsea Semantic Language (BSL) guards over the current history.
  • Auto-chain Module: Automates W3 (actor-serial per key) by chaining new events to the last write per actor/key.
  • Batch Reactor: The core dataflow driver implementing the snapshot–batch–fixpoint workflow (F(H)F(H)).
  • Admission Controller: Enforces model-based generation (A9) via two-phase event admission logic.

The execution loop is as follows:

  1. Take a snapshot of HH.
  2. For each guard YY, if condition GYG_Y holds and all candidate events emitted by emitY(H)\mathrm{emit}_Y(H) pass admission, construct new events Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}0, generate their references, and append to Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}1.
  3. Repeat until a fixpoint Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}2 is reached (no guard fires).

Formally:

Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}3

Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}4

Each new event Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}5 obtains references from explicit, auto-chain, and base mechanisms (Boldachev, 20 Oct 2025).

3. Axioms, Invariants, and Determinism Guarantees

Boldsea enforces nine axioms (A1–A9) and three invariants (I1–I3):

  • A1: Event existence from fixation, not external verification.
  • A2: Causality defined only by explicit references.
  • A3: No unlisted causes.
  • A4: Multiperspectivity—conflicting branches can coexist.
  • A5: Presumption-of-truth—events are usable immediately.
  • A6: Corrections/refutations only via new events; no deletion.
  • A7: Last-Write-Wins per actor/key, determined by the Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}6-maximal event.
  • A8: Partitioning history by key (Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}7).
  • A9: Model-based event validation—existence of a model, permission, valid payload, and all existential predicates witnessed in refs.

The invariants are:

  • I1: Monotonicity (append-only, no deletion).
  • I2: Acyclicity of Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}8.
  • I3: Full traceability (finite, reconstructible causal cones).

Deterministic execution is guaranteed by stratified negation, finiteness of guards, and monotonic, acyclic Key:=ModelID×Context\text{Key} := \text{ModelID} \times \text{Context}9. The existence of a least fixed point for HH0 is proved constructively (Boldachev, 20 Oct 2025).

4. Declarative Programming with Boldsea Semantic Language (BSL)

BSL is a model-driven domain-specific language rooted in first-order logic with temporal extensions. The mini-grammar includes formulae such as

HH1

where atomic predicates include type-tests, field equalities, existential quantification, and order relations (“Order(HH2 BEFORE HH3)”). A typical guard in BSL could be:

HH4

with an emission constructing a new "exec" event. Event validation and actor authorization are declaratively enforced through the "admit_incoming" predicate, guaranteeing A9 at runtime (Boldachev, 20 Oct 2025, Boldachev, 11 Sep 2025).

5. Event Validation, Causal Chains, and Model-Based Admission

Admissibility of new events is governed by model-based validation (A9) and causal chaining (W3). For any event HH5:

  • Event Admission: There must exist a model HH6 such that HH7, the actor is authorized, the payload is schema-valid, and existential predicates in HH8 are witnessed in refs.
  • Auto-chain: For every actor HH9 and key HkH_k0, new events are chained to the HkH_k1-maximal prior event by HkH_k2 on HkH_k3, ensuring per-actor serializability.

These mechanisms ensure all formal properties at runtime. Table 1 summarizes the event admission process.

Step Description Formal Condition
Model match Event references existing model HkH_k4
Actor authorized Actor meets Permission(M) HkH_k5
Payload validated Payload passes schema(M) HkH_k6
Causal witnesses Witnesses satisfy existential predicates HkH_k7

6. Dataflow Execution and Unification of Data and Logic

Model events act as dataflow operators, while reification events serve as data tokens. The semantic store integrates both models and events, so that process execution, business logic, and ontology are always consistent. Dataflow execution is subscription-driven: model events subscribe to classes of prior events and fire declaratively via condition satisfaction. There is no compilation—the engine interprets BSL directly over the event graph, with model modification immediately reflected in engine behavior. The system provides full temporal transparency: every system state at any time HkH_k8 is reconstructible from event history up to HkH_k9 (Boldachev, 11 Sep 2025).

7. Application Scenarios and Domain Fit

Boldsea is demonstrated in multiple workflow and ontology contexts, including:

  • Microservice Orchestration: Each microservice acts as a subject, models constrain schema and permissions, and guards drive inter-service automation. All causality is purely graph-based, not time-based.
  • DLT-Style Ledgers: Events capture asset transfers, UTXO dependencies are modeled as refs, and the causal graph itself is the ledger.
  • IoT Sensor Networks: Actor roles, value ranges, and anomaly detection use models and guards to automate alerting.
  • Collaborative Editing with Multiperspectivity: Each editor's changes are distinct branches; resolution is policy-driven via new merge events, not forced by the engine.

In all domains, causal order is established with hb:=tc(refs)\text{hb} := \mathrm{tc}(\mathrm{refs})0—never by timestamp. Fixation, validation, and multiperspectivity accommodate distributed, asynchronous, and conflicting observations natively (Boldachev, 20 Oct 2025, Boldachev, 11 Sep 2025).


In summary, the Boldsea Engine provides a deterministic, formally grounded platform for ontology-driven workflow execution, unifying event data and declarative business logic in an append-only, causally ordered store. Its semantics and system architecture support high assurance in correctness, multiperspectivity, and transparent process automation for distributed and complex system domains.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (2)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Boldsea Engine.