Tag
state-machines
- Oct 24, 2026 How a DFA Decides Membership: Transition Tables and the Extended Transition Function The five-tuple, the recursive lift of the transition function to whole strings, and the table layouts that make each input symbol cost one dependent load. computation theory
- Feb 8, 2026 Lifecycle Callbacks and the Process Importance Ranking Why an app receives stopped and destroyed notifications in a fixed order, how the platform derives that order from a ranked list of processes, and which transitions are not reversible. mobile computing
- Aug 10, 2025 Stream Identifiers and the State Machine That Makes Closing Cheap How the low two bits of a QUIC stream ID encode direction and initiator, why IDs are never reused, and how reset and stop-sending terminate a stream without waiting for a FIN. internet protocols
- Nov 22, 2024 Circuit Breaker State Machines and Half-Open Probing The three states, the counters that drive transitions, and why the half-open probe count is the parameter that decides whether a recovering dependency survives its own recovery. backend systems
- Nov 6, 2024 Stackful and Stackless Coroutines: Where Suspension Is Allowed A stackful coroutine can suspend inside any call; a stackless one can only suspend where the compiler emitted a resume point. The difference is a per-task stack versus a state machine, and it decides which libraries a task may call. language runtimes
- Mar 26, 2024 Specifying Behaviour as a State Machine with Guards Why a transition table beats prose for event-driven behaviour, how guards resolve overlapping transitions, and what unreachable states reveal about a specification. software engineering
- Jun 30, 2023 Optimistic Extension Use and the Cost of Unconfirmed Capability What it means to use a feature before the peer has agreed to it, how the fallback path is designed, and why unconfirmed state is the hardest part to get right. internet protocols
- Mar 7, 2023 The Job Record State Machine: Enqueue, Claim, and Acknowledge How a durable job queue represents work as a record with an explicit state machine, why claiming must be a single conditional update, and which guarantees the record cannot provide. backend systems
- Nov 10, 2022 Model-Based Testing with Explicit State Machines How a reference model plus a generator of valid operation sequences tests stateful systems, why the model must be simpler than the code, and how traces localize a divergence. software engineering
- Jul 27, 2022 Scheduling Without a Scheduler: Superloops and Their Latency Budget How a main loop plus interrupt handlers bounds worst-case response time, where jitter creeps in, and the point at which the structure stops meeting its deadlines. embedded systems