Requirements on the Execution of Kahn Process Networks

Geilen, M., & Basten, T. (2003). Requirements on the Execution of Kahn Process Networks. Programming Languages and Systems.

Type

Book chapter

Intellectual base

Review or monograph

Year

2003

DOI

10.1007/3-540-36575-3_22

ISBN

9783540008866

Link

https://doi.org/10.1007/3-540-36575-3_22

Cited by

1 citation across 1 artifact.

Domain-specific

• Kahn Process Networks
  • Parks shows that termination and bounded-buffer questions are undecidable in general and develops bounded scheduling strategies; naively making writes block can introduce artificial deadlock. Later execution analyses distinguish semantic correctness from feasible schedules and capacities.

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:8d7bf06bbf2a · see in the full table