Paper

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Categories: Software Engineering (cs.SE), Programming Languages (cs.PL), Software Architecture Keywords: software architecture, declarative systems, deterministic execution, protocol governance, AI-generated code, auditability, separation of concerns, constitutional primitives, architectural layers, behavioral concerns ...

© 2026 Bhash Ganti. All rights reserved. Bhash Ganti (aka Bachi) Contact: bachipeachy@gmail.com Abstract The rapid acceleration of AI-assisted software generation exposes a fundamental limitation in conventional software architecture: behavior is implicitly defined by implementation, while governance operates reactively and at human speed. This mismatch creates a structural gap in which systems can exhibit unauthorized, non-deterministic, and unauditable behavior. Existing approaches — static analysis, runtime guardrails, policy engines — attempt to constrain behavior after code is produced, but cannot guarantee compliance when implementation evolves faster than governance capacity. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Categories: Software Engineering (cs.SE), Programming Languages (cs.PL), Computational Complexity (cs.CC) Keywords: Turing completeness, universal computation, protocol governance, declarative systems, constitutional architecture, deterministic execution, auditability, AI-era software Introduction Motivation: Why Turing Completeness Is No Longer Enough The theory of computation has long celebrated Turing completeness as the definitive measure of computational power. A system is deemed “complete” if it can simulate any Turing machine—if it can compute any function that is computable in principle . This criterion, established nearly a century ago, remains the benchmark against which programming languages, virtual machines, and computational models are evaluated. ...

Contact: mailto:bachipeachy@gmail.com Preface This paper is part of the PGS technical paper series. The paper Protocol-Governed Systems: Conceptual Model established the architectural foundations: constitutional governance, the four-layer stack, and the separation of governance from execution. The paper Protocol-Governed Systems: Compiler Conceptual Model described how the compiler converts protocol declarations into a governed execution boundary called the Protocol Snapshot. The paper Protocol-Governed Systems: Runtime Conceptual Model described how the runtime consumes that boundary and executes governed behavior without containing any domain knowledge. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the structural core of protocol-governed systems through a constitutional taxonomy based on two orthogonal primitives: layers and concerns. Prior work established the separation between behavioral specification and execution mechanics [Bachi, 2026a] and demonstrated that constitutional constraint is compatible with universal computation [Bachi, 2026b]. This paper isolates the structural grammar that makes such governance enforceable. ...

(c) 2026 Bhash Ganti Bhash Ganti Contact: bachipeachy@gmail.com Purpose: Define the conceptual model for Protocol-Governed Systems, validated through the PGS reference implementation. Audience: Protocol designers, compiler authors, runtime implementers, conformance engineers Abstract Protocol-Governed Systems (PGS) propose a computational architecture in which governance precedes execution. Instead of relying on runtime policies, conventions, or post-hoc validation, PGS defines admissible behavior through governed protocol artifacts that are compiled into deterministic execution structures before runtime begins. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the governance mechanics of protocol-governed systems. Building on the structural taxonomy defined in Paper 3 [Bachi, 2026c], it specifies how behavioral law is proposed, validated, ratified, versioned, and amended. ...

Contact: mailto:bachipeachy@gmail.com Preface This paper is part of PGS technical paper series. The paper, Protocol-Governed Systems: Conceptual Model, established the architectural foundations: constitutional governance, the separation of governance from execution, and the four-layer stack that makes governed execution possible. This paper focuses on one component of that stack: the PGS compiler. The compiler is the mechanism that converts governance declarations into a structure that execution can consume. Understanding what the compiler does, what it produces, and what it guarantees is essential to understanding how PGS works. No prior knowledge of compilers is assumed. The paper is written for readers who understand the PGS conceptual model and want to understand how its central promise — governance before execution — is actually delivered. ...

Historic working paper. An early, DOI-published draft preserved for historical reference. Its implementation terminology predates the current PGS compiler and runtime architecture and is superseded by the current Papers. Figures survive only in the canonical PDF below. Download PDF (canonical, with figures) Contact: bachipeachy@gmail.com Abstract This paper formalizes the semantics of protocol artifacts in protocol-governed systems. Building on the structural taxonomy defined in Paper 3 [Bachi, 2026c] and the governance lifecycle established in Paper 4 [Bachi, 2026d], it specifies how behavioral law is represented in ratified protocol artifacts. ...

Contact: mailto:bachipeachy@gmail.com Preface This paper is part of the PGS technical paper series. The paper Protocol-Governed Systems: Conceptual Model established the architectural foundations: constitutional governance, the four-layer stack, and the separation of governance from execution. The paper Protocol-Governed Systems: Compiler Conceptual Model described how the compiler converts protocol declarations into a governed execution boundary called the Protocol Snapshot. Together, those two papers establish that behavior is fully determined before execution begins. This paper focuses on the component that consumes that boundary: the PGS runtime. ...