A formal model of composing components: the TLA+ approach

In this paper, a method for writing composable TLA⁺ specifications that conform to the formal model called Masaccio is introduced. Specifications are organized in TLA⁺ modules that correspond to Masaccio components by means of a trace-based semantics. Hierarchical TLA⁺ specifications are built from atomic component specifications by parallel and serial composition that can be arbitrary nested. While the rule of parallel composition is a variation of the classical joint-action composition, the authors do not know about a reuse method for the TLA⁺ that systematically employs the presented kind of a serial composition. By combining these two composition rules and assuming only the noninterleaving synchronous mode of an execution, the concurrent, sequential, and timed compositionality is achieved.     

数字逻辑虚拟实验教学研究

本文阐述了将虚拟现实及网络技术应用到数字逻辑实验教学中的理论过程。并详细介绍了运用Flash、插件等多媒体编程技术建设数字逻辑虚拟实验室的详细过程。同时,对未来计算机实验教学的发展方向进行了讨论。     

人工智能实验教学探讨

本文一方面简单介绍人工智能的基本理论及知识体系结构,另一方面则结合笔者的理论实践与实验教学经验,总结出目前在整个教学过程所存在的一些问题,目的在于不断总结经验,力争能更好地完成人工智能的整个教学工作,从而提高人才培养的质量,同时也可以为其他高校提供参考。     

Modalities in linear logic weaker than the exponential “of course”: Algebraic and relational semantics

We present a semantic study of a family of modal intuitionistic linear systems, providing various logics with both an algebraic semantics and a relational semantics, to obtain completeness results. We call modality a unary operator on formulas which satisfies only one rale (regularity), and we consider any subsetW of a list of axioms which defines the exponential of course of linear logic. We define an algebraic semantics by interpreting the modality as a unary operation on an IL-algebra. Then we introduce a relational semantics based on pretopologies with an additional binary relationr between information states. The interpretation of is defined in a suitable way, which differs from the traditional one in classical modal logic. We prove that such models provide a complete semantics for our minimal modal system, as well as, by requiring the suitable conditions onr (in the spirit of correspondence theory), for any of its extensions axiomatized by any subsetW as above. We also prove an embedding theorem for modal IL-algebras into complete ones and, after introducing the notion of general frame, we apply it to obtain a duality between general frames and modal IL-algebras.     

A fuzzy-based interleaved multi-hop authentication scheme in wireless sensor networks

In sensor networks, a compromised node can either generate fabricated reports with false votes or inject false votes into real reports, which causes severe damage such as false alarms, energy drain and information loss. An interleaved hop-by-hop authentication (IHA) scheme addresses the former attack by detecting and filtering false reports in a deterministic and hop-by-hop fashion. Unfortunately, in IHA, all en-route nodes must join to verify reports while only a few are necessary to the authentication procedure. In this paper, we propose a fuzzy-based interleaved multi-hop authentication scheme based on IHA. In our scheme, the fuzzy logic system only selects some nodes for verification based on the network characteristics. Moreover, we apply a voting method and a hash-based key assignment mechanism to improve network security. Through performance evaluation, the proposed scheme is found to save up to 13% of the energy consumption and to provide more network protection compared to IHA.