Above- and below-ground biomass accumulation, production, and distribution of sweetgum and loblolly pine grown with irrigation and fertilization.

Abstract: Increased forest productivity has been obtained by improving resource availability through water and nutrient amendments. However, more stress-tolerant species that have robust site requirements do not respond consistently to irrigation. An important factor contributing to robust site requirements may be the distribution of biomass belowground, yet available information is limited. We examined the accumulation and distribution of above- and below-ground biomass in sweetgum (Liqrridambar sfyrac$lua L.) and loblolly pine (Pinus taeda L.) stands receiving irrigation and fertilization. Mean annual aboveground production after 4 years ranged from 2.4 to 5.1 ~g.ha-'.year' for sweetgum and from 5.0 to 6.9 ~g.ha-l.year-l for pine. Sweetgum responded positively to irrigation and fertilization with an additive response to irrigation + fertilization. Pine only responded to fertilization. Sweetgum root mass fraction (RME)in creased with fertilization at 2 years and decreased with fertilization at 4 years. There were no detectable treatment differences in loblolly pine RMF. Development explained from 67% to 98% of variation in shoot versus root allometry for ephemeral and perennial tissues, fertilization explained no more than 5% of the variation in for either species, and irrigation did not explain any. We conclude that shifts in allocation from roots to shoots do not explain nutrient-induced growth stimulations

Model checking coverability graphs of vector addition systems

A large number of properties of a vector addition system—for instance coverability, boundedness, or regularity—can be decided using its coverability graph, by looking for some characteristic pattern. We propose to unify the known exponential-space upper bounds on the complexity of such problems on vector addition systems, by seeing them as instances of the model-checking problem for a suitable extension of computation tree logic, which allows to check for the existence of these patterns. This provides new insights into what constitutes a “coverability-like ” property