Effects of oxide promoters on metal dispersion and metal-support interactions in Ni catalysts supported on activated carbon

Various oxide-promoted Ni catalysts supported on activated carbon were prepared, and the effect of promoters on the surface structure and properties of Ni catalysts was studied. Physical adsorption (Na adsorption), thermogravimetric analysis (TGA), temperature-programmed desorption (TPD), X-ray diffraction (XRD), and X-ray photoelectron spectroscopy (XPS) were used to characterize the catalysts. It is found that nickel is fairly uniformly distributed in the pores of the carbon support. Addition of promoters produces a more homogeneous distribution of nickel ion in carbon. However, distributions of promoters in the pores are varying. Addition of promoters increases the dispersion of nickel in carbon. Promoters also change the interaction between the carbon and Ni, resulting in significantly different behaviors of catalysts under various environments. CaO and MgO promoters improve the reactivity of nickel catalysts with O-2 but retard the interaction between nickel oxide and carbon. La2O3 shows some inhibiting effect on the interactions between nickel oxide and oxygen as well as carbon.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.