Skip to content

Queueing, Networks & Concurrent Systems

← Back to Domain-Specific Families

Abstractions about coordinating flows and access in networked or concurrent systems, spanning queueing and occupancy theorems (Jackson's theorem, Bartlett's theorem), network protocol and mapping concepts (network allocation vector, network mapping, reachability analysis), and scheduling or dependency patterns (time-sharing, sequential coupling, unambiguous Turing machine).

9 abstractions in this family — domain-specific abstractions that sit near one another in structural-signature space (k-means over structural-signature embeddings). Each is shown with its short description.

  • Bartlett's theorem — A Poisson-arrival occupancy theorem for independently moving individuals in a system's regions.
  • Evacuation Simulation — Dynamic computational modeling of people or flows moving through constrained routes to estimate evacuation performance under specified scenarios.
  • Jackson's Theorem (Queueing Theory) — A queueing-network theorem giving a product-form stationary distribution for stable Markovian service nodes with suitable external arrivals and probabilistic routing.
  • Network allocation vector — A per-station duration state that virtually reserves a shared wireless medium.
  • Network mapping — Constructing a layer-specific representation of computer-network connectivity from bounded evidence.
  • Reachability analysis — Exploring reachable global states of communicating entities and their message medium from an initial configuration.
  • Sequential Coupling — Bind the correctness or availability of one interface operation to a prior call sequence, creating a temporal dependency that is safe only when the protocol is explicit, enforceable, and aligned with the object's state machine.
  • Time-sharing — Sharing finite processor time by alternating execution intervals among runnable tasks or users.
  • Unambiguous Turing machine — A nondeterministic Turing machine with at most one accepting computation path on each input, regardless of how many rejecting branches it has.