Automated design of self-stabilization

Self-stabilization is a property of a distributed system such that, regardless of the legitimacy of its current state, the system behavior shall eventually reach a legitimate state and shall remain legitimate thereafter. The elegance of self-stabilization stems from the fact that it distinguishes distributed systems by a strong fault tolerance property against arbitrary state perturbations. The difficulty of designing and reasoning about self-stabilization has been witnessed by many researchers; most of the existing techniques for the verification and design of self-stabilization are either brute-force, or adopt manual approaches non-amenable to automation. In this dissertation, we first investigate the possibility of automatically designing self-stabilization through global state space exploration. In particular, we develop a set of heuristics for automating the addition of recovery actions to distributed protocols on various network topologies. Our heuristics equally exploit the computational power of a single workstation and the available parallelism on computer clusters. We obtain existing and new stabilizing solutions for classical protocols like maximal matching, ring coloring, mutual exclusion, leader election and agreement. Second, we consider a foundation for local reasoning about self-stabilization; i.e., study the global behavior of the distributed system by exploring the state space of just one of its components. It turns out that local reasoning about deadlocks and livelocks is possible for an interesting class of protocols whose proof of stabilization is otherwise complex. In particular, we provide necessary and sufficient conditions – verifiable in the local state space of every process – for global deadlock- and livelock-freedom of protocols on ring topologies. Local reasoning potentially circumvents two fundamental problems that complicate the automated design and verification of distributed protocols: (1) state explosion and (2) partial state information. Moreover, local proofs of convergence are independent of the number of processes in the network, thereby enabling our assertions about deadlocks and livelocks to apply on rings of arbitrary sizes without worrying about state explosion.

Understanding Michigan nonindustrial private forest landowners attitudes and knowledge about forest management

Approximately one-fourth of the non-industrial private forestland (NIPF) owners in the state of Michigan, who collectively own approximately 50% of the private forested land, have conducted commercial timber harvest in recent years. Previous studies indicated that NIPFs preferred to manage their forest for a sustained yield of high-quality timber, but were limited to even-aged regeneration treatments or conversion for uneven-aged silviculture due to previous cuttings. Improved knowledge about NIPF’s intentions and forest management behavior could be useful for successful implementation of sustained yield management. This study’s objective was to identify more active NIPF’s attitudes towards timber management, their forest management practices and whether their forest management behavior leads or leads not to q management for sustained yield. Active NIPF’s intentions to harvest timber for biofuels and its suitability with NIPF’s forest management behavior will be discussed. Phone interviews of 30 NIPFs who have experience with commercial timber harvests were conducted between August and October 2011. All interviews were recorded, transcribed, and analyzed for identifying NIPF’s motivations, attitudes, forest management behavior and forestry related knowledge. Interviewees, whether consciously or not, tended to manage their land for a sustained yield and they would be willing to harvest timber for biofuels facility as long as it benefits landowners management goals.