Decomposability

Courtois, P. J. (1977). Decomposability: Queueing and Computer System Applications. Academic Press.

Type

Book

Intellectual base

Review or monograph

Year

1977

Link

https://archive.org/details/decomposabilityq0000courmatched

Cited from

systems_cybernetics

Cited by

1 citation across 1 artifact.

Primes

• Hierarchical Decomposability
  • Simon called this near-decomposability, and his claim was strong: near-decomposability is why complex systems are tractably analyzable at all, a thesis Courtois (1977) later formalized through the queueing-theoretic analysis of decomposable Markov chains.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:6b292211d6cc · see in the full table