Product and by-product formation in laboratory studies on disinfection electrolysis of water using boron-doped diamond anodes

Boron-doped diamond (BDD) electrodes were studied with respect to the formation of inorganic by-products in water electrolysis. Experiments in non-divided cells were performed with systems containing sulphate, chloride, chlorite, chlorate and nitrate ions. Discontinuous experiments in thermostated cells with rotating disk diamond anodes and expanded mesh IrO₂ cathodes were carried out at 20 °C. Current density was varied between 50 and 300 A m⁻². Ion chromatography was mainly used for species detection.

It was not possible to demonstrate the decomposition of sulphate although a slight tendency seems to exist in some experiments. Hydrogen peroxide is one of the anodic and cathodic by-products. Active chlorine is detectable at higher chloride concentrations compared with the use of mixed oxide anodes (MIO). One reason for this is the reaction of formed chlorine with ozone or hydrogen peroxide. Chlorate can be formed electrolysing chloride, hypochlorite and chlorite solutions. Perchlorate formation was detected. Cathodic processes are responsible for the formation of nitrite ions and ammonia. If chlorine is present, the formation of monochloramine is one possible side reaction. Results show that the processes are very complex. Reaction spectra may vary from case to case. Perchlorate formation is a high risk in drinking water treatment.     

面向等价性验证的锁存器匹配算法

为了克服现有等价性验证技术中难以精确匹配锁存器的局限性,提出了一种结合多种方法的新型锁存器匹配算法.该算法结合任意模拟、局部二叉判决图、目标模拟3种方法来匹配锁存器,并使用了类似滤波器的思想,任意模拟对锁存器作初步快速匹配,提出的局部二叉判决图技术降低了发生内存爆炸的可能性,目标模拟则针对性地对锁存器作进一步的划分. ISCAS89电路实验结果表明,该算法与模拟和自动测试矢量生成等方法相比,在运行时间、占用内存和匹配精度等方面均体现出有效性,可用于处理较大规模的时序电路验证问题.     

可满足赋值算子的设计与实现

在很多应用领域中,我们都需要获取逻辑公式所有无冗余的可满足解集合,即集合中的任意两个解不能互相蕴涵。为了获取无冗余解集合,本文提出了两种实现方案。由于二叉决策图BDD具有对逻辑公式的高效表达特性,因此两种方案都是在逻辑公式转换成BDD的基础上实现的[1]。一种方案是直接对该BDD进行遍历,获取从根节点到终端节点1的所有路径集合,然后借助一致性理论获取无冗余解的一致性算子的实现。另一种方案借助香农分解定理对BDD先进行逐层分解,然后对分解后的BDD再进行一致性运算的可满足赋值算子的实现。本文最后对两种方案的实验效果进行对比分析。     

Syntax-driven Behavior Partitioning for Model-checking of Esterel Programs

We consider the issue of exploiting the structural form of Esterel programs to partition the algorithmic RSS (reachable state space) fix-point construction used in model-checking techniques. The basic idea sounds utterly simple, as seen on the case of sequential composition: in P; Q, first compute entirely the states reached in P, and then only carry on to Q, each time using only the relevant transition relation part. Here a brute-force symbolic breadth-first search would have mixed the exploration of P and Q instead, in case P had different behaviors of various lengths, and that would result in irregular BBD representation of temporary state spaces, a major cause of complexity in symbolic model-checking.Difficulties appear in our decomposition approach when scheduling the different transition parts in presence of parallelism and local signal exchanges. Program blocks (or “Macro-states”) put in parallel can be synchronized in various ways, due to dynamic behaviors, and considering all possibilities may lead to an excessive division complexity. The goal is here to find a satisfactory trade-off between compositional and global approaches. Concretely we use some of the features of the TiGeR BDD library, and heuristic orderings between internal signals, to have the transition relation progress through the program behaviors to get the same effect as a global RSS computation, but with much more localized transition applications. We provide concrete benchmarks showing the usefulness of the approach.     

基于时态逻辑的硬件设计形式化验证技术——模型检验

通过对时态逻辑的研究来探讨时态逻辑在硬件设计形式化验证上的应用,同时对布尔函数在计算机内的表示二叉判定图（BDD）进行了进一步地分析,最后给出了一个时态逻辑对硬件设计进行验证的例子。     

基于BDD算法的系统安全性分析

随着现代武器系统越来越趋于大型化和复杂化,采用事故树方法进行系统安全性分析的难点问题也日益突出,本文研究了基于BDD的FTA优化求解算法,并采用此方法对某系统进行了相关安全性分析。     

基于遗传算法优化的BDD描述的数字电路功能测试

针对数字电路的测试两大难点，采用二元判决图(BDD)表示数字电路模型，同时由BDD生成测试矢量来完成数字电路的功能测试。在由VHDL描述完整电路功能的基础上用遗传算法对BDD的规模进行压缩优化。整个系统构成简单，自动化程度高，测试耗时少。     

模型检验中迁移关系的分组策略

迁移关系的构建是基于BDD模型检验中的一个重要环节，而建立占内存尽可能小且运算高效的迁移关系一直是难点，通常做法是对迁移关系进行分割．提出一种的对按位分割后的迁移关系进行分组的方法．通过对ISCAS-89中时序电路的试验表明，该方法对其中部分电路是有效可行的．     

基于新型故障搜寻策略的检测系统设计

为了达到复杂系统快速故障搜寻的目的,设计了一种基于二元决策图优化的新型故障搜寻策略的检测系统设计。通过对基于二元决策图优化的故障搜寻方法研究和实际的硬件电路设计,最终实现了检测系统的软硬件设计。使用这种方法能够很好的实现故障诊断系统在嵌入式平台的开发,并能够取得较好的诊断效果。