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.

Modern Computational Chemistry Methods for Prediction of Ground- and Excited-State Properties in Open-Shell Systems

The main goal of the research presented in this work is to provide some important insights about computational modeling of open-shell species. Such projects are: the investigation of the size-extensivity error in Equation-of-Motion Coupled Cluster methods, the analysis of the Long-Range corrected scheme in predicting UV-Vis spectra of Cu(II) complexes with the 4-imidazole acetate and its ethylated derivative, and the exploration of the importance of choosing a proper basis set for the description of systems such as the lithium monoxide anion. The most significant findings of this research are: (i) The contribution of the left operator to the size-extensivity error of the CR-EOMCC(2,3) approach, (ii) The cause of d-d shifts when varying the range-separation parameter and the amount of the exact exchange arising from the imbalanced treatment of localized vs. delocalized orbitals via the "tuned" CAM-B3LYP* functional, (iii) The proper acidity trend of the first-row hydrides and their lithiated analogs that may be reversed if the basis sets are not correctly selected.