Semigroup-theoretic analysis of supply-chain disruptions and resilience Authors: Job Agba Opue, Marshal I. Sampson, Otobong J. Tom, Uchechukwu E. Okorie, Fucai Lin, Fucai Lin, Fucai Lin Published: 2026 ABSTRACT This paper develops a rigorous framework using finite transformation semigroups to model supply-chain state evolution under cascading disruptions and resilience interventions. Disruptions and interventions are represented as non-invertible transformations on finite configuration spaces, generating a semigroup whose structure encodes collapse conditions, equilibria, minimal collapse-inducing sets, and redundancy. We establish explicit semigroup-theoretic criteria for synchronizing collapse, idempotent stabilisation, and redundancy identification via basis-pruning algorithms. The framework is illustrated with examples spanning manufacturing, agricultural, and e-commerce logistics systems. Analytical results, algorithmic procedures, and case studies demonstrate how semigroup properties map to measurable resilience indicators, providing interpretable, computationally tractable tools for assessing shock containment strategies in real-world networks. Introduction Global supply chains constitute large-scale distributed systems in which production, storage, and transportation decisions interact across spatial, temporal, and organisational boundaries [1,2]. As these systems have grown increasingly interconnected, they have become more vulnerable to cascading disruptions that originate locally but propagate through multi-tier supplier structures, multimodal transportation corridors, and demand-synchronisation mechanisms [1,3]. Empirical observations from the COVID-19 pandemic, the 2021 Suez Canal blockage, increasingly frequent climatic disturbances, and the fragmentation of global trade have repeatedly demonstrated that sequential disruptions can amplify one another in nonlinear ways [2,4]. A wide range of modelling approaches has been developed to analyse disruption propagation and resilience in supply chains. Network-based and operational models, including queueing systems, network flow formulations, simulation techniques, and optimisation frameworks, provide valuable tools for evaluating system performance and recovery strategies under uncertainty [2,5]. These approaches have improved understanding of disruption dynamics, resource allocation, and contingency planning, and they remain central to modern supply-chain analysis [1,3]. Nevertheless, many of these models focus primarily on numerical or probabilistic behaviour and may not explicitly capture the structural relationships governing how disruptions compose, accumulate, or stabilise through repeated operational actions [6,7]. Recent advances in network propagation models and operational simulations using real data provide detailed insights into how disruptions spread and how interventions can mitigate systemic risks [8,9]. While these approaches are informative, they often emphasise probabilistic outcomes and network metrics rather than enumerating all possible system configurations under sequential disruptions. Our work complements these studies by providing a mathematically exact, combinatorial perspective that captures the structural dependencies of disruptions and interventions. In such formulations, system changes are represented as transformations acting on a set of configurations, allowing sequential disruptions and recovery actions to be analysed through their compositional structure. Classical semigroup theory provides tools for studying the behaviour of repeated transformations, including the identification of stabilising actions, invariant subsets, and minimal generating mechanisms [10–12]. This perspective is particularly useful for capturing path-dependent behaviour, long-term stability, and systemic fragility arising from interacting disruption sequences. Motivated by these considerations, this work develops a modelling framework grounded in finite transformation semigroups [11–13]. Each disruption or intervention is interpreted as a transformation on a finite set of supply-chain states, and the evolution of the system is described by the semigroup generated by these transformations [14–16]. Collapse, recovery, and resilience correspond to identifiable structural properties of the transformation system, making long-term behaviour amenable to systematic analysis. The main contribution of this paper is the development of semigroup-theoretic criteria that characterise synchronising collapse behaviour, describe stabilisation through idempotent actions, identify minimal collapse-inducing generators, and detect redundant interventions [10,11,17]. These results provide structural insights that complement existing network and operational modelling tools while remaining operationally interpretable. Computational procedures, including pruning algorithms for eliminating redundant interventions, are introduced and applied to manufacturing, agricultural, and e-commerce supply chains [3,5]. Intuitive explanations connect each model component to economic outcomes, illustrating how disruptions and interventions impact production, delivery, and revenue. In contrast to traditional network-based and simulation-driven approaches, the present work contributes a structural and algebraic framework for analysing disruption propagation. Specifically, while network models typically evaluate flows, probabilities, or connectivity patterns, the semigroup-theoretic approach developed here characterises the full set of reachable system configurations under sequential disruptions and interventions. This allows precise identification of collapse-inducing mechanisms, stabilising configurations, and redundant intervention strategies within a finite and explicitly computable structure. In this sense, the framework complements existing network and operational models by providing a mathematically exact representation of disruption dynamics that supports systematic resilience planning and policy-oriented decision analysis. The remainder of the paper is organised as follows. Section Preliminaries and mathematical model presents the mathematical preliminaries and formulates the supply-chain configuration model using finite transformation semigroups, including the representation of disruptions and interventions as state transformations. Section Semigroup structure of supply-chain behaviours establishes structural conditions for synchronising collapse, idempotent stabilisation, and behavioural decomposition within the transformation system. Section Main results develops the principal theoretical results characterising collapse-inducing sequences and minimal generator sets responsible for systemic failure. Section Reachability lattices and shock-propagation geometry analyses the reachability lattice associated with disruption propagation and describes the structural patterns governing cascading effects. Section Algorithms for shock propagation and intervention optimisation introduces computational procedures for simulating disruption dynamics and identifying redundant interventions. Section Case study: multi-sector supply-chain analysis provides illustrative case studies in manufacturing, agriculture, and e-commerce supply chains with operational interpretation of the model outcomes. Finally, Section Conclusion summarises the principal findings and outlines directions for further research on algebraic approaches to supply-chain resilience. Supporting datasets, transformation matrices, reachability tables, and sample computational scripts are provided in the appendices to facilitate transparency and reproducibility of the analytical procedures. Preliminaries and mathematical model This section establishes the mathematical foundation for the semigroup-based representation of supply-chain disruptions. We begin with classical definitions from transformation semigroup theory [10–12] and proceed to construct a supply-chain state space suitable for modelling realistic logistics systems. All results in later sections depend on these foundational concepts. Finite transformation semigroups Let X be a finite set. A transformation on X is a function t:X→X. The set of all transformations on X is denoted by XX and forms a monoid under composition [10]. A finite transformation semigroup is any subsemigroup S⊆XX [12]. Definition 1 (Transformation semigroup‌‌). Let X be a finite set. A semigroup S of transformations on X is any set where A⊆XX is a generating set [11]. Definition 2 (Synchronising transformation). A transformation t∈XX is called synchronising if it maps all states to a single state: |t(X)| = 1. If S contains a synchronising element, we say that S itself is synchronising [12]. Synchronising elements correspond to collapse transformations in supply chains. Definition 3 (Idempotent). A transformation e∈XX is idempotent if e2 = e. Idempotents represent stable equilibria or steady-state configurations [18]. The algebraic structure of S—its idempotents, minimal generating sets, synchronising elements and Green’s relations—encodes properties of the real supply chain [19,20]. Supply-chain state space construction Let 𝒩 denote the set of nodes in a supply chain: factories, suppliers, warehouses, ports, and distribution hubs. Each node v∈𝒩 is assigned a local configuration state from a finite set Cv describing capacity utilisation, material availability, or operational status. Definition 4 (Global configuration state). The global configuration state of the supply chain is the tuple Each element x=(xv)v∈𝒩 represents the status of every node [12]. Since each Cv is finite, the entire space X is finite. For realistic models, the cardinality of X can be large, but remains manageable for algebraic and computational analysis [6,7]. Example (Manufacturing supply chain). Suppose a manufacturer has three nodes: with local states The global state space is X=CF×CW×CP with 3×2×3=18 distinct configurations. Disruptions and interventions as transformations Each disruption (e.g., port closure, factory downtime, transport delay) is modelled as a transformation d:X→X, and each intervention (e.g., rerouting, buffer activation, capacity expansion) as i:X→X, citing related work [1,2]. Definition 5 (Disruption transformation). A disruption transformation is a mapping d that reduces capacity, interrupts flow, or modifies availability rules, typically non-invertibly [17]. Definition 6 (Intervention transformation). An intervention transformation is a mapping i that restores, reroutes, or stabilises the system, possibly also non-invertibly [17]. These transformations compose according to temporal order. A sequence of events (a1,a2,…,ak) corresponds to the composite transformation ak∘⋯∘a2∘a1, as described in [11]. Running example and transition diagram Consider a simplified system with only two global states: Suppose a disruption d forces the system into the degraded state, and a recovery action r partially restores the system [10]. Transformation table: A simple state diagram illustrating these transitions is shown in Fig 1. This example will be expanded in later sections to illustrate collapse, idempotent stabilisation, minimal generators and redundancy detection. Transition diagram for a two-state system with disruption d and recovery r. The diagram shows the state transitions between normal (x0) and degraded (x1) states under the disruption transformation d and recovery transformation r. Semigroup structure of supply-chain behaviours This section develops the algebraic structure underlying supply-chain disruptions and resilience mechanisms, showing how classical semigroup concepts provide rigorous tools for analysing collapse, stabilisation and redundancy. Throughout the section, X denotes the finite global state space defined in Section Supply-chain state space construction, and S=⟨𝒜⟩ denotes the transformation semigroup generated by disruptions and interventions defined in Section Disruptions and interventions as transformations [10–12]. Synchronising transformations and collapse Synchronisation is one of the most important concepts in transformation semigroup theory, and in the supply-chain context it corresponds to complete systemic collapse. Formally, a transformation t is synchronising if |t(X)| = 1 (Definition 2) [11,12]. Proposition 1 (Existence of collapse states). If a disruption d∈S maps at least one state x∈X to a bottleneck state x* that is absorbing under all subsequent disruptions, then d is synchronising. Proof. Let x* be a bottleneck state such that for every disruption d′∈𝒜, d′(x*)=x*. If d(x)=x* for some x∈X, then for any y∈X, the sequence d′∘d satisfies (d′∘d)(y)=d′(d(y)). Since d(y) must eventually reach x* under repeated disruptions, and x* is absorbing, it follows that every state is mapped to x* by some composition involving d. Thus d is synchronising. This result formalises empirically observed behaviour in which a critical-link failure (e.g., closure of a unique major port) drives the entire system into a minimal-capacity regime [1,2]. Theorem 2 (Collapse criterion). Let S=⟨𝒜⟩ be the semigroup of disruptions and interventions. Then S contains a synchronising element if and only if there exists a finite sequence of disruptions (d1,…,dk) such that dk∘⋯∘d1(X) consists of a single global configuration. Proof. (⇒) If S contains a synchronising element t, then t=dk∘⋯∘d1 for some sequence since S is generated by 𝒜 [11]. (⇐) Conversely, if such a sequence exists, its composition maps all states to a single state, and therefore it is synchronising [12]. This characterisation allows simulation-based identification of collapse sequences and serves as the foundation for minimal generator analysis in Section Minimal collapse-inducing generator sets [11]. Operational interpretation. In practical manufacturing systems, production and distribution often depend on a limited number of critical infrastructure components such as ports, warehouses, or transport corridors. When one of these components fails, downstream activities may gradually accumulate delays until the system can no longer meet demand. In the present framework, such failures are represented as transformations that move the system from one operational state to another. A collapse state therefore represents a situation in which production or delivery cannot continue without external intervention, such as restoring the port, rerouting shipments, or using alternative suppliers. Economic interpretation (E-commerce). In e-commerce logistics networks, system performance depends on the reliability of warehouses, transportation routes, and delivery hubs. Disruptions such as warehouse congestion, vehicle breakdowns, or routing failures change the system configuration and may delay order fulfillment. In the semigroup-based model, each operational change is treated as a transformation of the system state. A collapse state represents a condition in which orders cannot be processed or delivered efficiently, while stabilisation states represent restored operational capacity after corrective actions such as rerouting shipments or reallocating inventory. Revenue loss, service-level degradation, and customer dissatisfaction accumulate until interventions restore operational flow. Idempotent stabilisation and recovery states Recovery interventions often push the system into stable or quasi-stable steady states where applications of the same recovery procedure no longer yield additional improvement. This behaviour is captured algebraically by idempotents [10,12]. Proposition 2 (Existence of recovery idempotents). Let i∈S be an intervention transformation. If repeated application of i converges to a steady state for every x∈X, i.e., then the limiting transformation e is an idempotent in S. Proof. The limit is well-defined because X is finite. Since e(x)=limk→∞ik(x), we also have demonstrating e2 = e [10]. □ Theorem 4 (Stabilisation criterion). A supply-chain system has an intervention-induced stable regime if and only if the semigroup S contains at least one nontrivial idempotent e≠id. Proof. If such an e exists, then repeated application leaves the system unchanged: e2 = e. Conversely, if a stable regime exists under interventions, the limiting transformation is an idempotent by Proposition 3 [10].□ Interpretation. Idempotents represent stabilised operating modes. Examples include: a reduced-capacity equilibrium after a manufacturing disruption, a stable rerouting pattern in e-commerce logistics, and a consistent post-shock procurement equilibrium in agricultural supply chains [2]. Green’s relations and resilience partitions Green’s relations offer a deep decomposition of the semigroup S and provide structural insight into resilience patterns. We briefly recall the classical definitions [10,19]. For s,t∈S: Definition 7 (Resilience partition). The partition of S into its 𝒟-classes is the resilience partition of the supply-chain system. Each class consists of transformations with equivalent controllability and vulnerability profiles. Theorem 5 (Resilience level classification). Let S be the supply-chain transformation semigroup. Then: (1) 𝒟-classes containing synchronising elements correspond to collapse-inducing behaviours. (2) 𝒟-classes containing idempotents correspond to stable recovery regimes. (3) Higher 𝒥-classes correspond to transformations requiring more interventions to regain operational feasibility. Proof. Each statement follows from the structural theory of finite semigroups and the interpretation of synchronising and idempotent transformations established in Sections Synchronising transformations and collapse and Idempotent stabilisation and recovery states. Synchronising elements form minimal 𝒥-classes. Idempotents generate maximal subgroups within 𝒟-classes. The remaining claims follow from standard Green’s relation properties [10,11]. Operational meaning. A 𝒟-class with a synchronising element represents catastrophic vulnerability. A 𝒟-class with idempotents represents resilient stabilisation. Intermediate 𝒥-heights quantify difficulty of recovery [13,14]. Main results This section develops the theoretical foundations of disruption propagation and resilience behaviour in supply chains viewed as finite transformation semigroups. We first introduce algebraic indicators of systemic fragility, collapse, and intervention efficiency. We then establish theorems characterising synchronising collapse, idempotent stabilisation, and minimal generator sets capable of inducing full systemic failure. Throughout, we interpret the algebraic concepts in terms of manufacturing, agricultural, and e-commerce logistics networks. Synchronising collapse in transformation semigroups A synchronising transformation is one which maps all supply-chain configurations into a single terminal configuration representing systemic operational collapse. Such transformations represent worst-case disruptions, including multi-node factory shutdowns, global port congestion, or complete communication failures across a fulfilment network [10,11]. Operational interpretation. In practical manufacturing systems, production and distribution often depend on a limited number of critical infrastructure components such as ports, warehouses, or transport corridors. When one of these components fails, downstream activities may gradually accumulate delays until the system can no longer meet demand. In the present framework, such failures are represented as transformations that move the system from one operational state to another. A collapse state therefore represents a situation in which production or delivery cannot continue without external intervention, such as restoring the port, rerouting shipments, or using alternative suppliers. Example (Manufacturing collapse). Let dport model a major port shutdown. If every feasible routing configuration ultimately depends on that port, then repeated disruptions caused by dport push the system into a stable backlog configuration. The limiting state is synchronising and corresponds to total fulfilment failure [1]. Definition 8. A transformation t∈S⊆𝒯(X) is called synchronising if there exists x*∈X such that t(x)=x* for all x∈X. The element x* is called the collapse state. Theorem 6 (Synchronising collapse criterion). Let S=⟨T⟩ be the semigroup generated by a set of disruptions T. Then S contains a synchronising collapse transformation if and only if there exists a finite sequence of disruptions ti1,ti2,…,tik∈T such that the composite transformation tik∘⋯∘ti1 has image of size 1. Proof. (⇒) If a synchronising collapse transformation c∈S exists, then by definition c=tik∘⋯∘ti1 for some generators. Since c maps all states to a single collapse state, its image has size 1 [12]. (⇐) If there exists a composite transformation u=tik∘⋯∘ti1 whose image consists of a single state x*, then u(x)=x* for all x∈X, so u is itself a synchronising collapse transformation. From a supply-chain perspective, Theorem 6 states that complete systemic collapse emerges precisely when sequential disruptions eliminate operational diversity in the network. For example, a manufacturing network in which incremental factory shutdowns eventually force all production loads to a single terminal “failed” state satisfies the criterion. Similar interpretations apply to agricultural processing chains and e-commerce fulfilment networks facing cascading warehouse closures or routing failures [1]. Idempotent stabilisation and resilience plateaus While synchronising collapse captures catastrophic behaviour, long-term resilience is characterised by the emergence of idempotent transformations that stabilise the system’s reachable configurations. Such stabilisation reflects operational plateaus—states where additional disruptions cannot worsen the systemic condition [10,16]. Definition 9. A transformation e∈S is called idempotent if e2 = e. In supply-chain terms, an idempotent transformation represents a “stabilised disruption state” such that applying the same disruption repeatedly yields no further degradation. For instance, once all transport hubs serving a region are already saturated beyond capacity, additional congestion events may not alter the system’s configuration. Economic interpretation. From an economic perspective, each reachable configuration reflects potential production, delivery, and revenue outcomes under sequential disruptions. The least degraded join x∨y corresponds to the minimal operational loss that would occur if multiple disruptions happen simultaneously. Stabilised states in the lattice indicate levels of operational recovery, which map to achievable output, cost mitigation, or inventory reallocation. Collapse states highlight scenarios where revenue losses or service failures become total unless interventions such as alternative sourcing, expedited logistics, or financial support are applied. This interpretation connects the mathematical structure to tangible economic impacts for decision-makers. Theorem 7 (Existence of stabilisation idempotents). Let S be a finite transformation semigroup generated by disruptions T. Then S contains at least one idempotent, and every trajectory x,t1(x),t2t1(x),t3t2t1(x),… eventually enters a stabilisation cycle governed by an idempotent transformation. Proof. Since S is finite, any sequence of compositions must eventually repeat. Thus, for some m < n we have tn∘⋯∘t1=tm∘⋯∘t1. Let u=tm∘⋯∘t1. Then composing both sides on the left by u yields u∘u=u, showing that u is idempotent. Standard finiteness arguments imply that every orbit eventually enters a cycle, the entry point of which is governed by some idempotent [10,14]. This provides a rigorous mathematical interpretation of resilience plateaus: every supply-chain disruption trajectory eventually reaches a stable region where further degradation cannot occur unless an external intervention pushes the system into a new dynamical cycle [2]. Minimal collapse-inducing generator sets A natural question for resilience planning is to identify the smallest combination of disruption types that is capable of driving the system into full collapse. These correspond to minimal generator sets of synchronising transformations in the sense of semigroup basis theory [21–23]. The characterisation in Theorem 8 parallels minimality criteria for independent generating sets in finite semigroups developed in [21]. Definition 10. A set T′⊆T is a minimal collapse-inducing generator set if ⟨T′⟩ contains a synchronising collapse transformation but no proper subset of T′ does. Theorem 8 (Characterisation of minimal collapse-inducing sets). Let T be a set of disruptions generating S. A subset T′⊆T minimally induces collapse if and only if: (a) ⟨T′⟩ contains a synchronising transformation, and (b) for every t∈T′, the semigroup generated by T′⧵{t} does not contain a synchronising transformation. Proof. Necessity of (a) is immediate from the definition. For (b), minimality requires that removing any generator must eliminate the collapse property; otherwise T′ would not be minimal. Conversely, if both (a) and (b) hold, then T′ generates collapse but no proper subset does, so T′ is minimal. Operational interpretation. From an applied viewpoint, Theorem 8 quantifies the least number of simultaneous disruption categories required to provoke system-wide failure. For example: In manufacturing, simultaneous loss of a single critical supplier and a major transport lane may form a minimal collapse-inducing set. In agricultural supply chains, a combination of climatic failure and processing plant breakdown may constitute such a set. In e-commerce logistics, a pair of disruptions involving routing software failure and central warehouse shutdown may be sufficient. Minimal collapse generator sets therefore provide actionable insight for prioritising protective infrastructure investments. Reachability lattices and shock-propagation geometry The behaviour of a supply chain under sequential disruptions is encoded in the structure of its reachability lattice, formed by the set of all states reachable from the initial configuration under all possible compositions of disruption transformations. This section develops the geometric and combinatorial properties of these lattices, illustrating how they capture cascading shock topologies in manufacturing, agriculture, and e-commerce logistics. Reachability posets and lattice structure Given a finite supply-chain configuration space X and a transformation semigroup S⊆𝒯(X) generated by disruptions T, define the reachability relation as follows. Definition 11. For x,y∈X, we write x⪯Sy if there exists a transformation s∈S such that y = s(x). The set (X,⪯S) is called the reachability poset. The reachability poset encodes all forward shock trajectories from each state. In many supply-chain systems, this poset forms a lattice or a join-semilattice. Lemma 9 (Existence of joins). If every pair of states x,y∈X has a least upper bound with respect to the reachability relation, then (X,⪯S) forms a join-semilattice. Proof. Straightforward from order theory. If for each pair (x,y) the set {z:x⪯Sz and y⪯Sz} has a unique minimum, then the poset admits binary joins and is therefore a join-semilattice. In supply-chain terms, the join x∨y represents the “least degraded configuration” that both x and y can evolve into under sequences of disruptions. This captures the unification of shock paths under shared risk factors such as shared ports, suppliers, or routing channels. Shock-propagation geometry via state diagrams Shock geometry can be visualised through state transition diagrams. A canonical diagram representing a three-layer propagation network illustrating common patterns in logistics systems is shown in Fig 2. A canonical shock-propagation geometry with a unique collapse state x*. The diagram illustrates a three-layer propagation network where disruptions propagate downward through dependency hierarchies until converging on a shared collapse configuration. The geometry in Fig 2 is typical for multi-layered supply networks where disruptions propagate downward through dependency hierarchies until converging on a shared collapse configuration. Examples include: Manufacturing: cascading equipment failures propagating through production stages until all upstream components are uncoupled. Manufacturing: cascading equipment failures propagating through production stages until all upstream components are uncoupled. Agriculture: climatic shocks affecting regional harvests and then spreading to processing and storage nodes. Agriculture: climatic shocks affecting regional harvests and then spreading to processing and storage nodes. E-commerce logistics: routing failures at central hubs propagating outward to last-mile fulfilment nodes. E-commerce logistics: routing failures at central hubs propagating outward to last-mile fulfilment nodes. Green’s relations and structural decomposition Green’s relations provide powerful tools for decomposing supply-chain transformation semigroups into behavioural classes. Definition 12. For s,t∈S, define the Green’s relations: Interpreted operationally: ℒ-equivalence captures disruptions that produce identical sets of left reachability behaviours—i.e., they affect upstream operations in the same way. ℒ-equivalence captures disruptions that produce identical sets of left reachability behaviours—i.e., they affect upstream operations in the same way. ℛ-equivalence captures disruptions that yield the same right reachability behaviours—i.e., identical downstream effects. ℛ-equivalence captures disruptions that yield the same right reachability behaviours—i.e., identical downstream effects. 𝒥-equivalence captures disruptions generating the same overall systemic influence class. 𝒥-equivalence captures disruptions generating the same overall systemic influence class. Lemma 10. If a synchronising collapse transformation c exists, then it lies in the minimal 𝒥-class of S. Proof. If c maps all states to a single point, then for any s∈S, S c S = {c}. Thus {c} is a minimal ideal, and therefore c lies in the minimal 𝒥-class. Lemma 10 formalises the fact that synchronising collapse transformations occupy a structurally minimal position, representing the most severe disruption class from which recovery requires external intervention. Case studies: Lattice structures in sectoral systems We conclude this section with brief structural case studies demonstrating how reachability lattices appear in different industries. Manufacturing. Sequential machine failures form a lower-bounded lattice where joins correspond to common degraded output states achieved after losing shared suppliers or processing stages. Agriculture. Weather-induced disruptions form multi-branching lattices where climatic extremes unify shock paths across otherwise independent agricultural zones. E-commerce logistics. Routing reassignments form a near-semilattice where join operations correspond to the least congested reachable shared routing configuration after cascading fulfilment delays. Algorithms for shock propagation and intervention optimisation This section develops computational tools for identifying critical disruptions, evaluating minimal collapse-inducing sets, and pruning redundant interventions within the semigroup framework. Basis-pruning algorithm The basis-pruning algorithm (Table 1) eliminates redundant transformations from a generating set while preserving all reachable configurations. 10.1371/journal.pone.0350123.t001Table 1Basis-pruning algorithm for minimal intervention set. Input Finite transformation semigroup S with generating set G Output Minimal generating set G′ such that G′(X)=S(X) Step 1 Initialise G′←G Step 2 for each g∈G′ do Step 3 if (G′⧵{g})(X)=S(X) then Step 4 Remove g from G′ Step 5 end if Step 6 end for Step 7 return G′ Basis-pruning algorithm for minimal intervention set. Theorem 11 (Termination and correctness). The basis-pruning algorithm terminates in at most |G| iterations and produces a minimal generating set G′ preserving all reachable configurations. Proof. Proof. The algorithm checks each generator exactly once. Finite removal steps preserve S(X) by construction. Minimality follows because any further removal violates reachability. Shock-propagation simulation algorithm We simulate sequential disruptions by iteratively applying transformations to initial configurations (Table 2). 10.1371/journal.pone.0350123.t002Table 2Shock-propagation simulation algorithm. Input Initial state x0∈X, generator set G, number of steps N Output Set of reachable configurations after N steps Step 1 R←{x0} Step 2 for n = 1 to N do Step 3 Rnext←∅ Step 4 for each x∈R do Step 5 for each g∈G do Step 6 Add g(x) to Rnext Step 7 end for Step 8 end for Step 9 R←R∪Rnext Step 10 end for Step 11 return R Shock-propagation simulation algorithm. Complexity analysis. If |X| = n and |G| = k, each iteration takes at most O(nk) operations. For N steps, total complexity is O(N n k). Illustrative examples: Sectoral applications Manufacturing supply chains. Let X = {OK, Degraded, Failed}3 represent three interdependent production stages. Generators G={g1,g2,g3} model stage-specific disruptions. Basis-pruning identifies which disruptions are critical for system collapse. Agricultural supply chains. Let X = {Normal, Mild, Severe}2 for two dependent regions. Generators model climatic shocks. Basis-pruning highlights which regional shocks drive systemic collapse in the food supply network. E-commerce logistics. Let X = {Available, Delayed, Blocked}3 represent central hub operations. Generators model transport disruptions and rerouting. Pruning determines which hub failures are critical to overall fulfilment collapse. Case study: Multi-sector supply-chain analysis This section presents a hybrid case study combining theoretical semigroup analysis with realistic supply-chain data for three sectors: manufacturing, agriculture, and e-commerce logistics. We illustrate how synchronizing elements, idempotents, and basis-pruning algorithms can guide intervention‌‌ planning (Fig 3). Manufacturing stage disruption propagation‌‌ example. Manufacturing supply chains We model a three-stage electronics assembly line: X = {OK, Degraded, Failed}3. The generators G={g1,g2,g3} correspond to stage-specific disruptions due to equipment breakdowns‌‌, supply shortages, or labor strikes (Table 3). 10.1371/journal.pone.0350123.t003Table 3Generator effects on manufacturing stages.GeneratorStage 1Stage 2Stage 3 g 1 DegradedOKOK g 2 OKDegradedOK g 3 OKOKFailed Generator effects on manufacturing stages. Using the basis-pruning algorithm, we identify that g1 and g3 form a minimal collapse-inducing set (Fig 4). Applying the shock-propagation simulation with initial state OK-OK-OK yields: State transitions in manufacturing supply chain under minimal collapse set. Agricultural supply chains We consider two dependent regions with X = {Normal, Mild, Severe}2. Generators G={h1,h2} correspond to drought and pest infestation (Table 4). 10.1371/journal.pone.0350123.t004Table 4Generator effects on agricultural regions.GeneratorRegion 1Region 2 h 1 MildNormal h 2 NormalSevere Generator effects on agricultural regions. Basis-pruning identifies both generators as essential. Shock propagation simulation shows that after two steps, the system may reach a synchronizing state Severe-Severe, representing a regional collapse scenario (Fig 5). State transitions in agricultural supply chain under sequential shocks. E-commerce logistics We model three hubs with X = {Available, Delayed, Blocked}3. Generators G={k1,k2,k3} model network disruptions (Table 5). 10.1371/journal.pone.0350123.t005Table 5Generator effects on e-commerce hubs.GeneratorHub 1Hub 2Hub 3 k 1 DelayedAvailableAvailable k 2 AvailableBlockedAvailable k 3 AvailableAvailableBlocked Generator effects on e-commerce hubs. Simulation identifies k1,k2 as a minimal set leading to synchronizing state Blocked-Blocked-Available. Basis-pruning suggests k3 is prunable without affecting collapse reachability (Fig 6). State transitions in e-commerce logistics supply chain. Discussion and policy implications The multi-sector case study presented in Section Case study: multi-sector supply-chain analysis demonstrates the practical applicability of finite transformation semigroup methods for analyzing supply-chain resilience. Across manufacturing, agricultural, and e-commerce networks, we observe that minimal collapse-inducing generator sets and synchronizing elements provide a rigorous lens for identifying critical vulnerabilities and designing targeted interventions. Cross-sector insights Several common patterns emerge from the analysis: Minimal generators highlight critical vulnerabilities. Across all sectors, identifying essential generators allows managers to pinpoint the disruptions that have the highest systemic impact. For example, g1 and g3 in manufacturing, h1 and h2 in agriculture, and k1 and k2 in e-commerce form minimal sets responsible for collapse states. Minimal generators highlight critical vulnerabilities. Across all sectors, identifying essential generators allows managers to pinpoint the disruptions that have the highest systemic impact. For example, g1 and g3 in manufacturing, h1 and h2 in agriculture, and k1 and k2 in e-commerce form minimal sets responsible for collapse states. Synchronizing states correspond to systemic collapse scenarios. Synchronizing elements map all configurations to a single state representing failure (e.g., Severe-Severe in agriculture, Blocked-Blocked-Available in e-commerce). Recognizing these states allows preemptive mitigation. Synchronizing states correspond to systemic collapse scenarios. Synchronizing elements map all configurations to a single state representing failure (e.g., Severe-Severe in agriculture, Blocked-Blocked-Available in e-commerce). Recognizing these states allows preemptive mitigation. Idempotent stabilisation offers operational equilibrium points. In each sector, idempotent transformations define stable configurations where repeated application of certain interventions does not change the system state. Such points are candidates for low-cost maintenance or monitoring regimes. Idempotent stabilisation offers operational equilibrium points. In each sector, idempotent transformations define stable configurations where repeated application of certain interventions does not change the system state. Such points are candidates for low-cost maintenance or monitoring regimes. Basis-pruning reveals intervention redundancies. Generators that are prunable do not contribute to additional reachable states and can be deprioritized, thereby optimizing resource allocation. Basis-pruning reveals intervention redundancies. Generators that are prunable do not contribute to additional reachable states and can be deprioritized, thereby optimizing resource allocation. Strategic implications for supply-chain management From a policy perspective, the semigroup framework informs both preventive and reactive strategies: Targeted investment in critical nodes. Resources can be focused on the system components corresponding to essential generators, reducing the likelihood of collapse. Targeted investment in critical nodes. Resources can be focused on the system components corresponding to essential generators, reducing the likelihood of collapse. Monitoring synchronization indicators. By tracking system states approaching synchronizing configurations, managers can trigger early interventions to prevent full-scale collapse. Monitoring synchronization indicators. By tracking system states approaching synchronizing configurations, managers can trigger early interventions to prevent full-scale collapse. Design of robust intervention protocols. Basis-pruning ensures that intervention strategies are minimal yet effective, avoiding unnecessary redundancies and operational overhead. Design of robust intervention protocols. Basis-pruning ensures that intervention strategies are minimal yet effective, avoiding unnecessary redundancies and operational overhead. Cross-sector coordination. The framework enables comparison of vulnerability structures across sectors, informing coordinated responses, e.g., when manufacturing delays propagate to e-commerce logistics. Cross-sector coordination. The framework enables comparison of vulnerability structures across sectors, informing coordinated responses, e.g., when manufacturing delays propagate to e-commerce logistics. Scenario analysis and stress testing. Simulations using transformation semigroups allow exploration of extreme scenarios, evaluating system resilience under sequences of disruptions. Scenario analysis and stress testing. Simulations using transformation semigroups allow exploration of extreme scenarios, evaluating system resilience under sequences of disruptions. Advantages of semigroup approach Compared to traditional network or stochastic approaches, the semigroup methodology offers: Exact combinatorial characterization. All reachable configurations and collapse pathways can be enumerated. Exact combinatorial characterization. All reachable configurations and collapse pathways can be enumerated. Scalable computation for finite state spaces. While the state space grows combinatorially, pruning and minimal generator techniques reduce computational load. Scalable computation for finite state spaces. While the state space grows combinatorially, pruning and minimal generator techniques reduce computational load. Interpretability and transparency. Unlike black-box simulations, each transformation and its effect is mathematically explicit, allowing clear traceability of intervention outcomes. Interpretability and transparency. Unlike black-box simulations, each transformation and its effect is mathematically explicit, allowing clear traceability of intervention outcomes. Flexibility across sectors. The same algebraic machinery applies to manufacturing, agriculture, e-commerce, and potentially other domains such as healthcare supply chains and energy logistics. Flexibility across sectors. The same algebraic machinery applies to manufacturing, agriculture, e-commerce, and potentially other domains such as healthcare supply chains and energy logistics. Limitations and future work While the framework provides rigorous tools for finite configuration spaces, several limitations are noteworthy: State-space explosion. For very large networks, the number of configurations grows exponentially, necessitating approximation or aggregation. State-space explosion. For very large networks, the number of configurations grows exponentially, necessitating approximation or aggregation. Simplifying assumptions on generator effects. Real-world disruptions may be probabilistic or partially observable, whereas our model treats transformations deterministically. Simplifying assumptions on generator effects. Real-world disruptions may be probabilistic or partially observable, whereas our model treats transformations deterministically. Temporal dynamics. Current models capture discrete steps but do not explicitly include continuous time evolution, delay propagation, or stochastic recovery rates. Temporal dynamics. Current models capture discrete steps but do not explicitly include continuous time evolution, delay propagation, or stochastic recovery rates. Data requirements. Practical application requires accurate mapping of real disruptions to discrete transformation functions. Data requirements. Practical application requires accurate mapping of real disruptions to discrete transformation functions. Future research directions include: Integration with stochastic or probabilistic semigroups to handle uncertain disruptions. Integration with stochastic or probabilistic semigroups to handle uncertain disruptions. Extension to multi-layered networks where interactions across sectors create cascading dependencies. Extension to multi-layered networks where interactions across sectors create cascading dependencies. Development of scalable computational tools and software packages implementing the pruning and synchronization algorithms. Development of scalable computational tools and software packages implementing the pruning and synchronization algorithms. Empirical validation using historical supply-chain disruption data for predictive assessment. Empirical validation using historical supply-chain disruption data for predictive assessment. Algorithms and pseudocode This section presents structured algorithms for simulating supply-chain shock propagation and performing basis-pruning of generator sets. All algorithms operate on the finite configuration space X and the generating set G of transformations. Simulation of shock propagation The shock propagation simulation algorithm (Table 6) iteratively applies disruption transformations to track system state evolution (Fig 7). 10.1371/journal.pone.0350123.t006Table 6Shock propagation simulation algorithm. Input Configuration space X, generating set G={g1,…,gk},initial state x0∈X, maximum steps N Output Sequence of system states {xn} and detection of collapse Step 1 x←x0 Step 2 Initialise StateHistory ←[x] Step 3 for n = 1 to N do Step 4 Select a generator g∈G according to policy or random Step 5 x←g(x) Step 6 Append x to StateHistory Step 7 if exists s∈S such that s(X) is synchronizing then Step 8 Output: System collapsed at step n, collapse state x Step 9 Break Step 10 end if Step 11 end for Step 12 Return: StateHistory Shock propagation simulation algorithm. Flow diagram for shock propagation simulation (Table 6). Basis-pruning algorithm The basis-pruning procedure for minimal generating set is detailed in Table 7 (Fig 8). 10.1371/journal.pone.0350123.t007Table 7Basis-pruning procedure for minimal generating set. Input Generating set G={g1,…,gk}, configuration space X Output Minimal generating set G′⊆G such that G′(X)=S(X) Step 1 G′←G Step 2 for each g∈G do Step 3 Gtest←G′⧵{g} Step 4 if Gtest(X)=G′(X) then Step 5 Remove g from G′ Step 6 end if Step 7 end for Step 8 Return: G′ Basis-pruning procedure for minimal generating set. Flow diagram for basis-pruning (Table 7). Complexity considerations Shock propagation simulation. Each step requires O(1) evaluation of a generator, and in the worst case O(N) steps until either collapse is reached or maximum iterations are completed. For a full enumeration of all sequences up to length L, complexity is O(|G|L), necessitating pruning or heuristic selection. Basis-pruning. Iterates through |G| generators, checking equivalence of reachable sets. If S(X) has size M, each check is O(M), giving overall complexity O(|G| M). For large configuration spaces, caching intermediate results reduces redundant computations. Illustrative example of algorithm application Using the synthetic configuration set X={x1,x2,x3,x4} and generator set G = {a,b,c} from Section Numerical illustrations and algorithmic procedures, the shock propagation simulation produces the sequence: The basis-pruning algorithm identifies that c is prunable, yielding minimal generating set G′={a,b}. This result directly informs the design of efficient intervention policies by highlighting the essential operations necessary for complete state coverage. Numerical illustrations and algorithmic procedures This section provides computational examples illustrating the semigroup-theoretic framework for supply-chain disruptions and resilience. The goal is to show how collapse sequences, stabilisation trajectories, and minimal generator sets can be identified systematically. Identifying synchronising collapse sequences Given a finite set of system configurations X and a set of disruption transformations T⊆𝒯(X), the following procedure detects synchronising collapse transformations: Enumerate candidate sequences (ti1,…,tik) of transformations from T up to a predefined maximum length kmax. Enumerate candidate sequences (ti1,…,tik) of transformations from T up to a predefined maximum length kmax. Compute the composite transformation tik∘⋯∘ti1 for each sequence. Compute the composite transformation tik∘⋯∘ti1 for each sequence. Check the image of each composite transformation. If the image is a singleton {x*}, then the sequence induces a synchronising collapse. Check the image of each composite transformation. If the image is a singleton {x*}, then the sequence induces a synchronising collapse. This procedure is a direct implementation of Theorem 6 and allows practitioners to pinpoint sequences of critical disruptions leading to full systemic failure. Evaluating idempotent stabilisation To explore long-term resilience, the following iterative procedure identifies stabilisation idempotents: Starting from an initial configuration x0∈X, iteratively apply a selected transformation t∈T to generate a trajectory: x1=t(x0),x2=t(x1),… Starting from an initial configuration x0∈X, iteratively apply a selected transformation t∈T to generate a trajectory: x1=t(x0),x2=t(x1),… Continue until the trajectory repeats or reaches a fixed point x*. Continue until the trajectory repeats or reaches a fixed point x*. The limiting transformation governing the fixed point is idempotent by Theorem 7. The limiting transformation governing the fixed point is idempotent by Theorem 7. This algorithmic procedure highlights resilience plateaus, where repeated disruptions no longer degrade the system, and provides a practical method to identify stabilised operating modes described in Section Idempotent stabilisation and recovery states. Pruning minimal generator sets To determine minimal sets of collapse-inducing transformations: Begin with a candidate generating set G⊆T that produces a synchronising collapse. Begin with a candidate generating set G⊆T that produces a synchronising collapse. For each g∈G, remove g and test whether the remaining set still generates a synchronising transformation. For each g∈G, remove g and test whether the remaining set still generates a synchronising transformation. Retain only transformations whose removal prevents collapse. The resulting set is a minimal generator set. Retain only transformations whose removal prevents collapse. The resulting set is a minimal generator set. This pruning method formalises the concept of critical interventions and maps directly to operational scenarios in manufacturing, agricultural, and e-commerce logistics networks. Illustrative example Consider a simple three-node manufacturing network with configurations X={x1,x2,x3} and disruptions T={t1,t2}. Applying the above procedures: Sequence (t1, t2) collapses all states to x3, revealing a synchronising collapse. Sequence (t1, t2) collapses all states to x3, revealing a synchronising collapse. Iterating t2 from x1 eventually reaches x2, an idempotent stabilised state. Iterating t2 from x1 eventually reaches x2, an idempotent stabilised state. Both t1 and t2 are necessary to induce full collapse, yielding a minimal generator set Gmin={t1,t2}. Both t1 and t2 are necessary to induce full collapse, yielding a minimal generator set Gmin={t1,t2}. Although simplified, this example demonstrates how the theoretical results of Sections Semigroup structure of supply-chain behaviours and Main results can be translated into actionable computational procedures. Conclusion This paper has developed a mathematically rigorous framework for analyzing supply-chain disruptions using finite transformation semigroups. By representing disruptions and interventions as transformations on a finite configuration space, we demonstrated how the semigroup structure encodes systemic fragility, collapse conditions, and stable equilibria. The main theoretical contributions include explicit criteria for identifying collapse-inducing sequences via synchronizing elements, establishing stability through idempotents, and determining minimal sets of generators necessary for triggering systemic collapse. Complementing these results, the basis-pruning algorithm provides a practical tool to identify and remove redundant interventions while preserving the complete set of reachable configurations. Illustrative examples and pseudocode demonstrate the applicability of this framework to diverse supply-chain contexts, including manufacturing, agricultural, and e-commerce networks. The algorithms are computationally tractable and enable simulation of shock propagation as well as assessment of intervention efficiency. Overall, this work unifies algebraic theory with operational modelling, providing a novel lens for resilience assessment in global supply chains. The framework offers both theoretical insight and practical guidance, laying a foundation for future studies that may integrate stochastic models, time-dependent interventions, and optimization of intervention strategies within the semigroup-theoretic setting. Supporting information Supplementary transformation data and computational procedures. This appendix provides supplementary transformation data, reachability tables, and computational procedures supporting the theoretical analysis developed in the main text. The examples illustrate how disruption and recovery processes in manufacturing, agricultural, and e-commerce supply chains can be represented as finite transformation semigroups. (DOCX) 2 Apr 2026 -->PONE-D-26-05436--> Semigroup-Theoretic Analysis of Supply-Chain Disruptions and Resilience PLOS One Dear Dr. Opue, Thank you for submitting your manuscript to PLOS ONE. After careful consideration, we feel that it has merit but does not fully meet PLOS ONE’s publication criteria as it currently stands. Therefore, we invite you to submit a revised version of the manuscript that addresses the points raised during the review process. Please submit your revised manuscript by May 16 2026 11:59PM. If you will need more time than this to complete your revisions, please reply to this message or contact the journal office at plosone@plos.org. When you're ready to submit your revision, log on to https://www.editorialmanager.com/pone/ and select the 'Submissions Needing Revision' folder to locate your manuscript file. Please include the following items when submitting your revised manuscript: A letter that responds to each point raised by the academic editor and reviewer(s). You should upload this letter as a separate file labeled 'Response to Reviewers'. A letter that responds to each point raised by the academic editor and reviewer(s). You should upload this letter as a separate file labeled 'Response to Reviewers'. A marked-up copy of your manuscript that highlights changes made to the original version. You should upload this as a separate file labeled 'Revised Manuscript with Track Changes'. A marked-up copy of your manuscript that highlights changes made to the original version. You should upload this as a separate file labeled 'Revised Manuscript with Track Changes'. An unmarked version of your revised paper without tracked changes. You should upload this as a separate file labeled 'Manuscript'. An unmarked version of your revised paper without tracked changes. You should upload this as a separate file labeled 'Manuscript'. If you would like to make changes to your financial disclosure, please include your updated statement in your cover letter. Guidelines for resubmitting your figure files are available below the reviewer comments at the end of this letter. If applicable, we recommend that you deposit your laboratory protocols in protocols.io to enhance the reproducibility of your results. Protocols.io assigns your protocol its own identifier (DOI) so that it can be cited independently in the future. For instructions see: https://journals.plos.org/plosone/s/submission-guidelines#loc-laboratory-protocols. Additionally, PLOS ONE offers an option for publishing peer-reviewed Lab Protocol articles, which describe protocols hosted on protocols.io. Read more information on sharing protocols at https://plos.org/protocols?utm_medium=editorial-email&utm_source=authorletters&utm_campaign=protocols. As the corresponding author, your ORCID iD is verified in the submission system and will appear in the published article. PLOS supports the use of ORCID, and we encourage all coauthors to register for an ORCID iD and use it as well. Please encourage your coauthors to verify their ORCID iD within the submission system before final acceptance, as unverified ORCID iDs will not appear in the published article. Only the individual author can complete the verification step; PLOS staff cannot verify ORCID iDs on behalf of authors. We look forward to receiving your revised manuscript. Kind regards, Fucai Lin, Ph.D. Academic Editor PLOS One Journal Requirements: When submitting your revision, we need you to address these additional requirements. 1.Please ensure that your manuscript meets PLOS ONE's style requirements, including those for file naming. The PLOS ONE style templates can be found at https://journals.plos.org/plosone/s/file?id=wjVg/PLOSOne_formatting_sample_main_body.pdf and https://journals.plos.org/plosone/s/file?id=ba62/PLOSOne_formatting_sample_title_authors_affiliations.pdf 2. Please note that PLOS One has specific guidelines on code sharing for submissions in which author-generated code underpins the findings in the manuscript. In these cases, we expect all author-generated code to be made available without restrictions upon publication of the work. Please review our guidelines at https://journals.plos.org/plosone/s/materials-and-software-sharing#loc-sharing-code and ensure that your code is shared in a way that follows best practice and facilitates reproducibility and reuse. 3. In the online submission form you indicate that your data is not available for proprietary reasons and have provided a contact point for accessing this data. Please note that your current contact point is a co-author on this manuscript. According to our Data Policy, the contact point must not be an author on the manuscript and must be an institutional contact, ideally not an individual. Please revise your data statement to a non-author institutional point of contact, such as a data access or ethics committee, and send this to us via return email. Please also include contact information for the third party organization, and please include the full citation of where the data can be found. 4. When completing the data availability statement of the submission form, you indicated that you will make your data available on acceptance. We strongly recommend all authors decide on a data sharing plan before acceptance, as the process can be lengthy and hold up publication timelines. Please note that, though access restrictions are acceptable now, your entire data will need to be made freely accessible if your manuscript is accepted for publication. This policy applies to all data except where public deposition would breach compliance with the protocol approved by your research ethics board. If you are unable to adhere to our open data policy, please kindly revise your statement to explain your reasoning and we will seek the editor's input on an exemption. Please be assured that, once you have provided your new statement, the assessment of your exemption will not hold up the peer review process. 5. Please ensure that you refer to Figures 3-8 in your text as, if accepted, production will need this reference to link the reader to the figure. 6. We note you have included a table to which you do not refer in the text of your manuscript. Please ensure that you refer to Table 1-3 in your text; if accepted, production will need this reference to link the reader to the Table. 7. If the reviewer comments include a recommendation to cite specific previously published works, please review and evaluate these publications to determine whether they are relevant and should be cited. There is no requirement to cite these works unless the editor has indicated otherwise. [Note: HTML markup is below. Please do not edit.] Reviewers' comments: Reviewer's Responses to Questions -->Comments to the Author 1. Is the manuscript technically sound, and do the data support the conclusions? The manuscript must describe a technically sound piece of scientific research with data that supports the conclusions. Experiments must have been conducted rigorously, with appropriate controls, replication, and sample sizes. The conclusions must be drawn appropriately based on the data presented.--> Reviewer #1: Yes Reviewer #2: Yes ********** -->2. Has the statistical analysis been performed appropriately and rigorously?--> Reviewer #1: Yes Reviewer #2: N/A ********** -->3. Have the authors made all data underlying the findings in their manuscript fully available? The PLOS Data policy requires authors to make all data underlying the findings described in their manuscript fully available without restriction, with rare exception (please refer to the Data Availability Statement in the manuscript PDF file). The data should be provided as part of the manuscript or its supporting information, or deposited to a public repository. For example, in addition to summary statistics, the data points behind means, medians and variance measures should be available. If there are restrictions on publicly sharing data—e.g. participant privacy or use of data from a third party—those must be specified.--> Reviewer #1: Yes Reviewer #2: No ********** -->4. Is the manuscript presented in an intelligible fashion and written in standard English? PLOS ONE does not copyedit accepted manuscripts, so the language in submitted articles must be clear, correct, and unambiguous. Any typographical or grammatical errors should be corrected at revision, so please note any specific errors here.--> Reviewer #1: Yes Reviewer #2: Yes ********** -->5. Review Comments to the Author Please use the space provided to explain your answers to the questions above. You may also include additional comments for the author, including concerns about dual publication, research ethics, or publication ethics. (Please upload your review as an attachment if it exceeds 20,000 characters)--> Reviewer #1: Paper is good, it is better if you add some application.The framework is illustrated with examples spanning manufacturing, agricultural, and e-commerce logistics systems. Analytical results, algorithmic procedures, and case studies demonstrate how semigroup properties map to measurable resilience indicators, providing interpretable, computationally tractable tools for assessing shock containment strategies in real-world networks. Reviewer #2: This is a completely theoretic paper with interesting applications of semi-group analysis to supply chains. It is interesting how authors relate the algebraic structure to disruptions and residence of supply chains in particular theoretic escenarios. However, some comments point out changes that should be made in order to be suited for publication. The theoretic analysis presented in the paper does complement existing literature such as network analysis and operational modeling. However, the paper is missing a review of related literature of such analyses. Authors should include in this literature review advances in network propagation models and application using data. Make a clearer presentation of contribution in contrast to network analysis. My main concern is regarding practical applicability to non-mathematicians. Despite the good theoretic presentation, authors should improve the explanation and intuition behind applied examples of supply chains. Supply chains are an important subject in economics and, as the paper currently stands, it will be hard for economists to follow and apply the algorithms proposed. This will be even harder for policy makers. In complement with my previous point, authors should improve presentation of the case study considering the analysis of economic situations. All theoretic data should be publicly available through a repository such as an Open Science Framework. Recommendation: addressed all comments before being suited for publication. ********** -->6. PLOS authors have the option to publish the peer review history of their article (what does this mean?). If published, this will include your full peer review and any attached files. If you choose “no”, your identity will remain anonymous but your review may still be made public. Do you want your identity to be public for this peer review? For information about this choice, including consent withdrawal, please see our Privacy Policy.--> Reviewer #1: Yes: E Keshava Reddy Reviewer #2: Yes: Martha G. Alatriste Contreras ********** [NOTE: If reviewer comments were submitted as an attachment file, they will be attached to this email and accessible via the submission site. Please log into your account, locate the manuscript record, and check for the action link "View Attachments". If this link does not appear, there are no attachment files.] To ensure your figures meet our technical requirements, please review our figure guidelines: https://journals.plos.org/plosone/s/figures You may also use PLOS’s free figure tool, NAAS, to help you prepare publication quality figures: https://journals.plos.org/plosone/s/figures#loc-tools-for-figure-preparation. NAAS will assess whether your figures meet our technical requirements by comparing each figure against our figure specifications. Submitted filename: Review_PlosOne_SemigroupTheoreticAnalysis.pdf 15 Apr 2026 Response to Reviewer Manuscript Title: Semigroup Theoretic Analysis of Supply-Chain Disruptions and Resilience Journal: PLOS ONE We sincerely thank the reviewer for the careful reading of our manuscript and for the constructive suggestions provided. We have revised the manuscript accordingly and addressed each comment in detail below. All changes have been incorporated into the revised manuscript to improve clarity, practical interpretation, and reproducibility. Reviewer Comment 1 “The theoretic analysis presented in the paper does complement existing literature such as network analysis and operational modeling. However, the paper is missing a review of related literature of such analyses. Authors should include in this literature review advances in network propagation models and application using data.” Response We appreciate this important suggestion. In response, we have expanded the Introduction to include a discussion of recent advances in network propagation models and data-driven disruption analysis. The revised text now situates the semigroup-based framework within the broader context of supply-chain modeling approaches, including network-based and simulation-based methods. These additions clarify how algebraic transformation models provide complementary structural insights beyond probabilistic or graph-based propagation models. Location in Manuscript Introduction section - literature review paragraph discussing network propagation and data-driven disruption models, with additional references included. Reviewer Comment 2 “Make a clearer presentation of contribution in contrast to network analysis.” Response We have revised the final paragraph of the Introduction to explicitly state the distinct contribution of the semigroup-theoretic approach relative to traditional network-based models. The revised text now emphasizes that the proposed framework focuses on structural properties of disruption transformations, including collapse states, reachability, and stabilisation behaviour, which are not directly captured by standard network flow or simulation models. This clarification strengthens the positioning of the work within the broader supply-chain modeling literature. Location in Manuscript Introduction section - concluding paragraph describing the theoretical and operational contributions of the proposed framework. Reviewer Comment 3 “My main concern is regarding practical applicability to non-mathematicians. Despite the good theoretic presentation, authors should improve the explanation and intuition behind applied examples of supply chains. Supply chains are an important subject in economics and, as the paper currently stands, it will be hard for economists to follow and apply the algorithms proposed. This will be even harder for policy makers.” Response We thank the reviewer for highlighting the importance of accessibility for practitioners and policy-oriented readers. To address this concern, we introduced additional explanatory text throughout the examples and case discussions to provide operational interpretation of the mathematical constructs. Specifically, we added descriptive paragraphs explaining: • how disruptions correspond to operational events such as port closures or logistics failures, • how repeated disruptions lead to backlog accumulation, • how stabilisation corresponds to restoration of operational capacity, • how collapse states represent conditions requiring external intervention. These additions provide intuitive explanations linking the algebraic framework to real-world supply-chain behaviour. Location in Manuscript Immediately before the manufacturing disruption example - new subsection titled: Operational Interpretation Reviewer Comment 4 “In complement with my previous point, authors should improve presentation of the case study considering the analysis of economic situations.” Response In response to this suggestion, we strengthened the practical interpretation of the case study examples by explicitly linking the mathematical framework to observable economic and logistics disruptions. The revised manuscript now includes: • clearer descriptions of production and delivery interruptions, • interpretation of collapse states as operational failure scenarios, • examples of corrective actions such as rerouting shipments or restoring infrastructure, • structured transformation examples representing logistics disruptions. In addition, we included a supplementary appendix containing illustrative transformation matrices and reachability tables that demonstrate how disruptions propagate through supply-chain states. These additions improve the economic relevance and interpretability of the examples while preserving the theoretical rigor of the model. Location in Manuscript Case study and example sections - expanded explanatory paragraphs. Appendix - supplementary transformation and reachability examples. Reviewer Comment 5 “All theoretic data should be publicly available through a repository such as an Open Science Framework.” Response We appreciate this recommendation regarding transparency and reproducibility. In response, we have added a formal Data Availability section to the manuscript describing how the data underlying the practical illustrations can be accessed. The revised manuscript now states that: • theoretical examples and computational materials are available from the corresponding author upon reasonable request, • practical disruption illustrations are based on publicly available logistics and port performance datasets. The dataset sources are now explicitly cited in the manuscript. To support reproducibility, we also included supplementary materials in the appendix containing: • representative transformation matrices, • reachability tables, • minimal collapse-inducing generator sets, • sample computational scripts. These materials allow readers to reproduce the structural analyses presented in the paper. Location in Manuscript Data Availability section - newly added. Appendix - supplementary transformation data and computational procedures. Summary of Revisions The revised manuscript now includes: • Expanded literature review on network propagation and data-driven supply-chain analysis, • Clearer statement of the contribution of semigroup-based modeling, • Improved operational interpretation of mathematical examples, • Stronger economic and logistics context for case studies, • Formal data availability statement and supplementary materials supporting reproducibility. We believe these revisions fully address the reviewer’s concerns and significantly strengthen the clarity, applicability, and transparency of the manuscript. We sincerely thank the reviewer for the thoughtful comments that helped improve the quality and accessibility of this work. Submitted filename: Response to Reviewer-Semigroup in Supply Chain.pdf 10 May 2026 Semigroup-Theoretic Analysis of Supply-Chain Disruptions and Resilience PONE-D-26-05436R1 Dear Dr. Opue, We’re pleased to inform you that your manuscript has been judged scientifically suitable for publication and will be formally accepted for publication once it meets all outstanding technical requirements. Within one week, you’ll receive an e-mail detailing the required amendments. When these have been addressed, you’ll receive a formal acceptance letter and your manuscript will be scheduled for publication. An invoice will be generated when your article is formally accepted. Please note, if your institution has a publishing partnership with PLOS and your article meets the relevant criteria, all or part of your publication costs will be covered. Please make sure your user information is up-to-date by logging into Editorial Manager at Editorial Manager® and clicking the ‘Update My Information' link at the top of the page. For questions related to billing, please contact billing support. If your institution or institutions have a press office, please notify them about your upcoming paper to help maximize its impact. If they’ll be preparing press materials, please inform our press team as soon as possible -- no later than 48 hours after receiving the formal acceptance. Your manuscript will remain under strict press embargo until 2 pm Eastern Time on the date of publication. For more information, please contact onepress@plos.org. Kind regards, Fucai Lin, Ph.D. Academic Editor PLOS One ********** -->Review Comments to the Author--> Reviewer #1: Application of problem taken as paper may be mention in the paper and paper can be made more effective using new technique. Reviewer #2: Literature review is limited but enough. Authors should make all data surrounding results fully available, not under reasonable request. ********** PONE-D-26-05436R1 PLOS One Dear Dr. Opue, I'm pleased to inform you that your manuscript has been deemed suitable for publication in PLOS One. Congratulations! Your manuscript is now being handed over to our production team. At this stage, our production department will prepare your paper for publication. This includes ensuring the following: * All references, tables, and figures are properly cited * All relevant supporting information is included in the manuscript submission, * There are no issues that prevent the paper from being properly typeset You will receive further instructions from the production team, including instructions on how to review your proof when it is ready. Please keep in mind that we are working through a large volume of accepted articles, so please give us a few days to review your paper and let you know the next and final steps. Lastly, if your institution or institutions have a press office, please let them know about your upcoming paper now to help maximize its impact. If they'll be preparing press materials, please inform our press team within the next 48 hours. Your manuscript will remain under strict press embargo until 2 pm Eastern Time on the date of publication. For more information, please contact onepress@plos.org. You will receive an invoice from PLOS for your publication fee after your manuscript has reached the completed accept phase. If you receive an email requesting payment before acceptance or for any other service, this may be a phishing scheme. Learn how to identify phishing emails and protect your accounts at https://explore.plos.org/phishing. If we can help with anything else, please email us at customercare@plos.org. Thank you for submitting your work to PLOS ONE and supporting open access. Kind regards, PLOS ONE Editorial Office Staff on behalf of Professor Fucai Lin Academic Editor PLOS One