Searcharxiv⌕ Search

arXiv subjects

Anatoly A. Krasnovsky

Publications and source records attributed to Anatoly A. Krasnovsky.

9 recordsLinked to original sources

Toward Operationalizing Rasmussen in Evolving Software Systems

Rasmussen's qualitative drift model explains how successive, locally successful adaptations under efficiency pressures can move a system toward unacceptable operation. Brooker and Hochstein applied this perspective conceptually to software operations without specifying a quantitative procedure for observing drift. We take a step in this direction and propose a runtime observer that quantitatively operationalizes the model's observable part for evolving software. The proposed observer is intended to give engineers evidence for pausing or revising adaptation before declared operating limits are crossed. It tracks how activity or resource use is distributed across components and types of work. Measurement history quantifies accumulated change and recent movement toward or away from current limits. Assuming that direction and limits remain unchanged, the proposed observer calculates the first constraint ahead and the amount of further change required to reach it. Measurements remain comparable across supported component changes, while policy revisions are distinguished from changes in execution. Preliminary runtime studies demonstrated these distinctions under annotated software changes and revised retry limits. A separate multivariate exponentially weighted moving average (MEWMA) experiment detected CPU redistribution earlier with log-ratio coordinates than with raw shares, motivating investigation of representation-dependent observation. Further work will ground constraints in service outcomes, investigate runtime-model acquisition, and test whether decisions informed by observed drift reduce violations at acceptable useful-work loss and intervention cost.

eess.SY↗

Model Discovery for Virtual Chaos Engineering with Incomplete Tracing: An eBPF Study

Model-based fault experiments can assess the consequences of component failures before intervening in a running application. Recent work on model discovery and graph simulation acquired operation models from application telemetry and used them for availability prediction. Applying this approach to operational legacy systems raises an acquisition problem: the required traces may be absent or incomplete, while introducing them can require changes across heterogeneous components. These systems continue to serve business operations during extended maintenance and modernization. External observation offers a possible route to model-based fault analysis before a tracing retrofit, but collecting telemetry does not by itself establish that an executable operation model can be obtained. We investigate this route using extended Berkeley Packet Filter (eBPF) observations and the existing graph-based modelling approach. A 108-case study varied application software development kit (SDK) tracing across absent, partial and full conditions in three public applications. Discovered dependencies were combined with declared operation requirements, deployment facts and scenario assumptions; model forecasts preceded independent execution checks. With SDK tracing disabled, the tested OpenTelemetry eBPF Instrumentation path supported all seven operations in two applications across three repetitions. Forecasts agreed exactly in 17 of 21 operation-repetition groups; the maximum state-weighted discrepancy was 4.22 percentage points. Combining observed context links supported nine additional groups under partial tracing. The results establish an acquisition path for virtual fault experiments under the tested observation constraints and identify limits imposed by protocols, evidence association and operation semantics.

cs.SE↗

A Reduced Stochastic Model of Microservice Availability: Algorithms for Identification and Formal Analysis

Estimating microservice operation availability requires connecting runtime observations to completion of the required work within a deadline. Detailed architectural models provide one route, but their reconstruction and analysis can be costly. We present algorithms for identifying and analysing a reduced stochastic availability model from telemetry and declared operation requirements. The identification procedure constructs a joint law of execution states and retains compatible laws when observations are incomplete. Formal results establish attainable probability bounds and conditions for identifying a completion-and-deadline representation directly. This construction preserves the range obtained by evaluating the same completion-and-deadline event in the full model; a separate joint comparison describes the structural information discarded. An independent study covered three microservice applications and 18 campaigns. On complete common campaigns with point forecasts from both methods, observed mean absolute errors differed from those of independently extracted PMX/Palladio architectural models by at most 0.082 percentage points. The full graph-based workflow from telemetry to first forecast was 31.73-100.24 times faster than the studied PMX/Palladio workflow, including startup and launcher waits. Direct identification preserved the retained forecasts and intervals, with median paired first-answer savings of 5.1-11.2% relative to full execution-model analysis. The results connect required model detail to measured identification and analysis costs.

cs.SE↗

Procrustes-Bering-Sheaft: Automated Model Discovery and Virtual Crash Tests for Microservices

Procrustes-Bering-Sheaft automates lightweight model discovery and virtual crash tests for microservices. Each test estimates operation availability by Monte Carlo sampling of service and communication failures. Procrustes checks deployment and tracing evidence; Bering discovers dependencies and incorporates replica declarations; Sheaft evaluates declared operation-success conditions. Independent command-line interfaces exchange reusable, versioned artifacts. The toolchain extends an earlier graph-based approach with mandatory-call contracts, failure-tolerance sweeps, baseline comparison, component-importance analysis, and CI/CD gates. We demonstrate the workflow on one HTTP operation. Six controlled execution states exposed two mismatches between reachability and observed success; an explicit required-call predicate matched all six. Two modelled one-replica additions produced different decisions: recommendation retained an availability-target violation, whereas catalog restored the baseline estimate of 0.979900 and grid tolerance of 0.12. Analytical oracles and controlled tests verify the implementation; archived replay checks numerical continuity with two earlier studies.

cs.SE↗

Emergence-as-Code as a Foundation for Reliable Self-Governance

Local adaptations can preserve component health while changing whether a system meets its reliability requirements. The system-level consequence depends on the interaction affected and its role in the user journey. Emergence-as-Code (EmaC) makes this relationship part of an executable, evidence-reconciled CompositeSLO assessment. A declared journey obligation persists while discovery maintains a hypothesis of its runtime realization. An inferred operator-to-role binding selects the measurements used in the calculation; its evidential status determines whether the binding supports a numerical assessment. Each result retains the obligation and versioned hypothesis as a basis for governance decisions. A PetClinic proof of concept recovered the exact operator-state/edge-binding change in all 20 randomized treatments, with no false change in 20 controls. EmaC and a manual dynamic composite matched disjoint semantic outcomes in all 40 conditions. A model with frozen suppression knowledge overestimated required-history availability by 0.01, placing treatments above a 0.995 target despite observed availability of 0.99. Ambiguous and contradictory evidence produced UNASSESSABLE. The research programme evaluates sustained binding maintenance, calibrated uncertainty, and the decision value of this requirement-level account of local adaptation.

cs.SE↗

Evaluating Asynchronous Semantics in Trace-Discovered Resilience Models: A Case Study on the OpenTelemetry Demo

While distributed tracing and chaos engineering are becoming standard for microservices, resilience models remain largely manual and bespoke. We revisit a trace-discovered connectivity model that derives a service dependency graph from traces and uses Monte Carlo simulation to estimate endpoint availability under fail-stop service failures. Compared to earlier work, we (i) derive the graph directly from raw OpenTelemetry traces, (ii) attach endpoint-specific success predicates, and (iii) add a simple asynchronous semantics that treats Kafka edges as non-blocking for immediate HTTP success. We apply this model to the OpenTelemetry Demo ("Astronomy Shop") using a GitHub Actions workflow that discovers the graph, runs simulations, and executes chaos experiments that randomly kill microservices in a Docker Compose deployment. Across the studied failure fractions, the model reproduces the overall availability degradation curve, while asynchronous semantics for Kafka edges change predicted availabilities by at most about 10^(-5) (0.001 percentage points). This null result suggests that for immediate HTTP availability in this case study, explicitly modeling asynchronous dependencies is not warranted, and a simpler connectivity-only model is sufficient.

cs.SE↗

Model Discovery and Graph Simulation: A Lightweight Gateway to Chaos Engineering

Chaos engineering reveals resilience risks but is expensive and operationally risky to run broadly and often. Model-based analyses can estimate dependability, yet in practice they are tricky to build and keep current because models are typically handcrafted. We claim that a simple connectivity-only topological model - just the service-dependency graph plus replica counts - can provide fast, low-risk availability estimates under fail-stop faults. To make this claim practical without hand-built models, we introduce model discovery: an automated step that can run in CI/CD or as an observability-platform capability, synthesizing an explicit, analyzable model from artifacts teams already have (e.g., distributed traces, service-mesh telemetry, configs/manifests) - providing an accessible gateway for teams to begin resilience testing. As a proof by instance on the DeathStarBench Social Network, we extract the dependency graph from Jaeger and estimate availability across two deployment modes and five failure rates. The discovered model closely tracks live fault-injection results; with replication, median error at mid-range failure rates is near zero, while no-replication shows signed biases consistent with excluded mechanisms. These results create two opportunities: first, to triage and reduce the scope of expensive chaos experiments in advance, and second, to generate real-time signals on the system's resilience posture as its topology evolves, preserving live validation for the most critical or ambiguous scenarios.

cs.SE↗

Measuring Uncertainty in Transformer Circuits with Effective Information Consistency

Mechanistic interpretability has identified functional subgraphs within large language models (LLMs), known as Transformer Circuits (TCs), that appear to implement specific algorithms. Yet we lack a formal, single-pass way to quantify when an active circuit is behaving coherently and thus likely trustworthy. Building on prior systems-theoretic proposals, we specialize a sheaf/cohomology and causal emergence perspective to TCs and introduce the Effective-Information Consistency Score (EICS). EICS combines (i) a normalized sheaf inconsistency computed from local Jacobians and activations, with (ii) a Gaussian EI proxy for circuit-level causal emergence derived from the same forward state. The construction is white-box, single-pass, and makes units explicit so that the score is dimensionless. We further provide practical guidance on score interpretation, computational overhead (with fast and exact modes), and a toy sanity-check analysis. Empirical validation on LLM tasks is deferred.

cs.LG↗

Sheaf-Theoretic Causal Emergence for Resilience Analysis in Distributed Systems

Distributed systems often exhibit emergent behaviors that impact their resilience (Franz-Kaiser et al., 2020; Adilson E. Motter, 2002; Jianxi Gao, 2016). This paper presents a theoretical framework combining attributed graph models, flow-on-graph simulation, and sheaf-theoretic causal emergence analysis to evaluate system resilience. We model a distributed system as a graph with attributes (capturing component state and connections) and use sheaf theory to formalize how local interactions compose into global states. A flow simulation on this graph propagates functional loads and failures. To assess resilience, we apply the concept of causal emergence, quantifying whether macro-level dynamics (coarse-grained groupings) exhibit stronger causal efficacy (via effective information) than micro-level dynamics. The novelty lies in uniting sheaf-based formalization with causal metrics to identify emergent resilient structures. We discuss limitless potential applications (illustrated by microservices, neural networks, and power grids) and outline future steps toward implementing this framework (Lake et al., 2015).

eess.SY↗