When Revocation Does Not Restore Safety: Exact Admission Across Asynchronous Policy Changes in Multi-Agent Systems

Abstract

A conditional exact unit-service admission theorem for inherited committed effects and independently timed in-flight effects. Includes constructive sharpness, finite/sparse computation, a specified unbounded count-abstraction gap, and controlled SQLite protocol tests. Main methods inherit network calculus and escrow; global priority and production safety are not established. Substantially AI-assisted research under Hongju Liu direction; not independently peer reviewed.