The complete scheduled ancestor set

The same proof applies to a general finite acyclic network by reversing its complete port dependencies. Joint outputs require their joint ancestor set. An upper bound may include gates whose actual channel has no influence on the chosen output.