Verilog操作语义研究

提出了一个结构化操作语义模型,用于描述Verilog核心子集的语言特征,此子集包含了事件驱动、基于共享变量的并发特性、时间延迟等Verilog的主要语言成分.在此操作语义模型中,所有的Verilog程序将被统一地认为是开放式系统,所以在此操作语义模型的基础上能够进一步提出Verilog开放进程的观察模型,并提出基于互模拟的观察等价概念来判定进程之间的等价关系.最后证明了所定义的观察等价关系对所有的Verilog构造子而言是一个同余关系,从而为发展相应的进程代数理论提供了一个可靠性基础.     

扰动模糊有限转换状态机

引入了扰动模糊有限转换状态机和扰动模糊有限状态机的（强）同态的概念,研究了它们的相关性质。给出了[Σ]的元素构成所有长度有限的词集上的两种同余关系,讨论商结构问题,证明了相应的所有等价类构成具有单位元的有限半群,并且这两个有限半群是同态的。给出了[Q]上容许关系及强同态的核的概念,研究了它们的相关性质。     

优化伪随机脉冲位置调制序列激励的无串扰超声测距系统

超声测距系统中多路换能器同时工作存在的串扰会导致错误的距离测量和降低系统的工作效率.为消除此串扰,提出伪随机脉冲位置调制(PPPM)法用于构造超声发射序列.PPPM序面中脉宽固定,脉冲位置由伪随机数序列调制.为获得满面春风锐的自相函数和平坦的互丰关函数,对四种常用的同余法产生的伪随机数进行了定量检验,并选定统计特性最好的系列静电型换能器构成的超声测距系统,实验验证了所提方法的可行性.     

Deduction, Strategies, and Rewriting

Automated deduction methods should be specified not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, different algorithms to implement a given inference system should be specified as strategies to apply the inference rules. The inference rules themselves can be naturally specified as (possibly conditional) rewrite rules. Using a high-performance rewriting language implementation and a strategy language to guide rewriting computations, we can obtain in a modular way implementations of both the inference rules of automated deduction procedures and of algorithms controling their application. This paper presents the design of a strategy language for the Maude rewriting language that supports this modular decomposition: inference systems are specified in system modules, and strategies in strategy modules. We give a set-theoretic semantics for this strategy language, present its different combinators, illustrate its main ideas with several examples, and describe both a reflective prototype in Maude and an ongoing C++ implementation.     

Determinization of fuzzy automata with membership values in complete residuated lattices

In this paper we introduce a new method for determinization of fuzzy finite automata with membership values in complete residuated lattices. In comparison with the previous methods, developed by Bělohlávek [R. Bělohlávek, Determinism and fuzzy automata, Information Sciences 143 (2002), 205-209] and Li and Pedrycz [Y.M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005), 68-92], our method always gives a smaller automaton, and in some cases, when the previous methods result in infinite automata, our method can result in a finite one. We also show that determinization of fuzzy automata is closely related to fuzzy right congruences on a free monoid and fuzzy automata associated with them, and in particular, to the concept of the Nerode’s fuzzy right congruence of a fuzzy automaton, which we introduce and study here.     

基于P-ECC和同余方程的分簇WSN节点身份认证机制

针对新节点加入的传感器网络中进行合法的身份认证带来的节点内存占有量大、计算量大、秘密值的信息安全度低等问题,提出一种适用于内存有限的传感网络,安全度高的节点身份认证机制。该方案采用增添节点自身密码,并采用单向哈希函数对密码和身份(ID)进行散列化,利用密码参与椭圆曲线的签名算法的生成,可信节点间采用同余方程的认证方案,且各认证阶段均采用互认证模式。该方案不仅能防范窃听、重放、注入等攻击,而且能抵御猜测攻击、中介攻击、匿名信息攻击和拒绝服务攻击。与现有算法相比,所提方案能减少节点最初内存占有量三个单位级别,减少密钥检测率。     

同余方程加密方案的研究

目前基于公钥的加密和会话密钥交换方案容易受到中间人攻击且效率不高。为此,提出了一种基于同余方程的加密和会话密钥交换方案,该算法可以安全高效地实现会话密钥的协商和加密消息的传输,并且还能防止中间人攻击。该方案在一定程度上防止第三者对传输消息的篡改,其安全性是建立在大数因子分解的困难性基础上的。     

基于线性同余比较器和混沌系统的伪随机序列生成方法

本文基于线性同余原理,设计一种线性同余比较器。该同余比较器将两个独立的线性同余生成器结合起来,用一个比较器来控制输出。将输出序列作为扰动信号,以异或函数叠加到混沌轨道来改善混沌系统生成序列的随机性。分析攻击者通过线性同余比较器生成序列来破解种子密钥的计算复杂度,及加入随机扰动后的混沌序列的平衡度、相关性及初值敏感性,结果表明,计算复杂度是呈指数幂增长的,线性同余比较器生成序列具有前向和后向不可预测性,并且该密钥流生成器具有较大的密钥空间,可以生成具有良好随机性的序列,可以有效地克服混沌序列在有限精度实现时出现的短周期问题。     

Any ground associative-commutative theory has a finite canonical system

It is shown that theories presented by a set of ground equations with several associative-commutative (AC) symbols always admit a finite canonical system. This result is obtained through the construction of a reduction ordering that is AC-compatible and total on the set of congruence classes generated by the associativity and commutativity axioms. As far as we know, this is the first ordering with such properties when several AC-function symbols and free-function symbols are allowed. Such an ordering is also a fundamental tool for deriving a complete theorem proving strategies with built-in associative commutative unification.     

F-Disjunctive languagest

A language L is f-disjunctive if every class of its syntactic congruence is finite. The family of f-disjunctive languages is a natural generalization of the family of disjunctive languages and both families are anti-AFL. Every f-disjunctive language is dense and every class (≠ 1) of its syntactic congruence is an infix code. Five different classes of f-disjunctive languages are considered and it is shown that they form a strict hierarchy. Also some properties of the syntactic monoid of a f-disjunctive language are established, in particular its decomposition as a subdirect product of nil monoids.