AIAleksandar Ivanović

Aleksandar Ivanović

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Aleksandar Ivanović has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A Calculus of Execution for Systems of Interacting Binary Relations

    by Milan Škarić, Aleksandar Ivanović, Miloš Radenković, Sergei Prokhorov, Aleksandra Labus, Božidar Radenković

    This paper develops an execution calculus for interacting binary relations from two requirements: R1, governance changes must be admitted under the same rule as domain events, and R2, historical admission judgments must admit deterministic verification replay. An extensional relation alone does not retain completed candidates, causal inputs, governing versions, or positive admission evidence. We introduce an ontological–eschatological–epistemic (OEE) lifting and a static execution architecture S1 with an append-only shared record, partial single-valued realization, independent total Boolean admission, immutable versioned specifications, and replayable evidence. Axiom 0 is characterized as the unique deterministic, faithful, non-withholding admission dynamics preserving S1 (Theorem A). S1 with Axiom 0 satisfies R1 and R2 (Theorem B), and none of its essential conditions can be omitted (Theorem C). For coded finitely branching fixed regimes, S1 induces a Scott execution domain with a three-status semantics of execution possibility. Execution-contract-preserving morphisms transport admitted traces, and recorded merges localize nondeterminism in interacting systems. The lifting separates operational completion, Boolean admission, fixed-regime reachability, and governed evolution between regimes as typed modalities of execution, and identifies ontology–criterion incompatibility and missing event-horizon interaction as structural sources of non-progress for which an admitted governing change may enable repair. A worked construction of a computable Dedekind cut with interacting number streams, and a factorization chain reusing admitted certificates, illustrate these obligations. The formalism is methodologically agnostic within the bounds set by S1.

  • Open Access

    Zero Tier Execution Substrate for Evolutionary Software Systems

    by Aleksandar Ivanović, Miloš Radenković, Sergei Prokhorov, Aleksandra Labus, Božidar Radenković

    Adaptive and evolutive software systems are characterized by ontologically defined non-determinism—not a defect but the primary force of their evolution. Non-determinism arises from recursion, interaction, and selection between abstract components and can only be resolved as the execution sequence grows sufficiently for one outcome to become determinate. In adaptive systems, managing this non-determinism through structural adaptation of abstract components during execution is the defining operational characteristic—one that no existing execution substrate formally supports. The problems of evolutive AI systems—inconsistency, non-reproducibility, absence of causal traceability, and an inability to enforce purpose-constrained autonomy—cannot be resolved within AI architectures alone. Resolving them requires a formal execution substrate in which causal context growth, resolution-moment detection, and structural adaptation of abstract components are first-class properties. This paper introduces the Zero Tier Execution Substrate (ZTES), grounded in a foundational model that defines execution as a sequence generated by recursive invocations of abstract components with ontologically specified purpose, in which non-determinism is resolved within the causal context of the sequence before commitment. ZTES is a homomorphic specification of this model, achieved through disciplined composition of the Mesarović–Takahara system ontology, Lamport-consistent causal ordering, P-DEVS transition semantics, and the Three-Phase execution kernel—mechanisms individually proven at a global scale. System execution is formally identified with the causal evolution of knowledge: Execution(Σ) ≡ Evolution(K). The historical knowledge base K has a two-dimensional orthogonal structure—the eschatological dimension encoding purpose lineage through recursive specialization, and the sequential dimension encoding event order through iterative mapping—which establishes purpose integrity as a substrate-level property of evolutive execution. The semantic closure of ZTES establishes deterministic reproducibility, governance–execution equivalence, and purpose-constrained autonomy as structural consequences of substrate closure rather than as additional architectural layers.


  • Open Access

    Zero Tier Execution Substrate for Evolutionary Software Systems

    by Aleksandar Ivanović, Miloš Radenković, Sergei Prokhorov, Aleksandra Labus, Božidar Radenković

    Several fundamental problems in software systems and AI remain without a unified formal solution. Deterministic reproducibility of execution, formal consistency between runtime state and historical record, and equivalence of governance and operational execution are unresolved across contemporary architectural paradigms. In AI systems, traceable decision processes and structurally enforced purpose-constrained autonomy remain open problems for the same reason. The common root is ontological: no formally defined execution substrate exists in which execution, governance, persistence, system evolution, and AI reasoning share a single causally ordered knowledge structure. This paper introduces the Zero Tier Execution Substrate (ZTES), an axiomatic execution model derived through formal synthesis of the Mesarović–Takahara system ontology, Lamport-consistent causal ordering, and the DEVS formalism. The Three-Phase execution kernel acts as semantic closure of this synthesis. The append-only historical knowledge base becomes the canonical computational medium in which governance and operational execution are formally equivalent transition processes over a single causally ordered structure. System execution is formally identified with the causal evolution of knowledge: Execution(Σ) ≡ Evolution(K). The substrate is universal for discrete processes: any discrete process admits execution within ZTES without loss of process identity, event ordering, or executable semantics. The scope of this work is foundational: the formal model establishes a stable foundation from which concrete realizations, empirical validations, and higher-level abstractions may be derived. ZTES does not introduce new computational primitives; it defines the minimal semantic discipline under which existing mechanisms — append-only persistence, causal ordering, and discrete-event transition semantics — are interpreted and composed as a structurally closed execution substrate. The formal model establishes deterministic event serialization, projection-defined runtime state, and compensa-tion-based correction without destructive mutation. Sixth Normal Form emerges as a natural ontological consequence of atomic event semantics rather than merely a storage design choice. A closure-based structural maturity model and benchmark for execution architectures are introduced as methodological contributions. These formal properties directly address the open problems identified above. ZTES therefore addresses several pre-viously unresolved structural problems: deterministic reproducibility of distributed execution, structural consistency between runtime state and historical record, and governance–execution equivalence within a single operational model. In AI systems, it establishes a substrate for historically consistent reasoning, traceable decision processes, and purpose-constrained autonomy as structural consequences of substrate closure. Software systems and AI infrastructures are therefore formally interpretable not as layered architectures but as causally evolving knowledge structures governed by formally defined execution semantics.