Checking Timed Büchi Automata Emptiness Efficiently

This paper presents an on-the-fly and symbolic technique for efficiently checking timed automata emptiness. It is symbolic because it uses the simulation graph (instead of the region graph). It is on-the-fly because the simulation graph is generated during the test for emptiness. We have implemented a verification tool called Profounder based on this technique. To our knowledge, Profounder is the only available tool for checking emptiness of timed Büchi automata. To illustrate the practical interest of our approach, we show the performances of the tool on a non-trivial case study.     

A review of: “FRACTALS EVERYWHERE”, by Michael Barnsley,Academic Press,San Diego,California, USA 1988

The modelling and analysis of multi-component discrete event systems is a challenging research area. Over 30 years, modelling and simulation research of discrete event system specification (DEVS) has been developed with (1) dense-time, (2) the I/O concept, and (3) hierarchical model construction. Nevertheless, DEVS model verification research began relatively recently considering the whole DEVS research history. In the meantime, over 15 years, the automata theory has been developed to cover the dense-time behaviour verification of discrete event systems. Especially, timed automata (TA) has performed the key role in the field.

This paper builds on the research results that have been achieved from both theories of DEVS and TA. Thus contributions of this paper can be seen from each side. From the viewpoint of the DEVS theory, a finite and nondeterministic DEVS has been found as a verifiable class. From the viewpoint of the TA theory, a TA which is modular and hierarchical as well as verifiable, is proposed. To show the results, this paper uses the top down manner in which a general formalism is defined first and then its sub-classes are introduced.     

iSCSI连接方式及性能试验

针对iSCSI可能的应用场合所需的不同网络连接方式进行了性能测试。     

一种面向Web服务的拜占庭错误容忍算法

随着Web服务的高速发展,其可靠性已经受到了越来越多的重视.针对当前拜占庭错误容忍算法对Web服务支持的不足,提出并设计了一种面向Web服务的拜占庭错误容忍算法.该算法与著名的CLBFT算法有显著区别.在Web服务中,为了支持组合服务必须对进行通信的Web服务双方都创建复制品,而CLBFT算法只在服务器方创建复制品.使用基于状态机的主动复制技术,在进行通信的Web服务双方都创建复制品.引入接收窗口和接收点对异步环境下的消息进行批量确认,同步各复制品收到消息的时间.用I/O自动机给出该算法的自动机模型,并通过遵循TPC-App Benchmark规范的实验平台实现了算法,验证了算法可行性.     

Using mappings to prove timing properties

Summary A new technique for proving timing properties for timing-based algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automaton whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multi-valued mapping from the assumptions automaton to the requirements automaton is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of progress functions providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a two-process race system. Nancy A. Lynch received the B.S. degree in mathematics from Brooklyn College, Brooklyn, NY, in 1968, and the Ph.D. degree in mathematics from the Massachusetts Institute of Technology, Cambridge, MA, in 1972. She is presently a professor of computer science and electrical engineering at Massachusetts Institute of Technology. She has also been on the computer science faculty at Georgia Institute of Technology and on the mathematics faculty at Tufts University and the University of Southern California. Her research interests are in distributed and real-time computing and theoretical computer science. In particular, she has worked on formal models and verification methods, on algorithm design and analysis, and on impossibility results. She also likes to hike and ski. Hagit Attiya received the B.Sc. degree in Mathematics and Computer Science from the Hebrew University of Jerusalem, in 1981, the M.Sc. and Ph.D. degrees in Computer Science from the Hebrew University of Jerusalem, in 1983 and 1987, respectively. She is presently a senior lecturer at the department of Computer Science at the Technion, Israel Institute of Technology. Prior to this, she has been a post-doctoral research associate at the Laboratory for Computer Science at M.I.T. Her general research interests are distributed computation and theoretical computer science. More specific interests include fault-tolerance, timing-based and asynchronous algorithms.This work was supported by ONR contracts N00014-85-K-0168 and N00014-91-J-1046, by NSF grants CCR-8611442 and CCR-8915206, and by DARPA contracts N00014-87-K-0825 and N00014-89-J-1988     

A comparison of simulation techniques and algebraic techniques for verifying concurrent systems

Simulation-based assertional techniques and process algebraic techniques are two of the major methods that have been proposed for the verification of concurrent and distributed systems. It is shown how each of these techniques can be applied to the task of verifying systems described as input/output automata; both safety and liveness properties are considered. A small but typical circuit is verified in both of these ways, first using forward simulations, an execution correspondence lemma, and a simple fairness argument, and second using deductions within the process algebra DIOA for I/O automata. An extended evaluation and comparison of the two methods is given.Supported by NSF grant CCR-89-15206, by DARPA contracts N00014-89-J-1988 and N00014-92J-4033, and by ONR contract N00014-91-J-1046.     

支持扩展虚拟同步的组通信算法形式描述与验证

组通信系统是为方便开发容错的分布式应用系统而提出的一种通信中间件．虚拟同步是组通信系统中的一个重要概念．其本质是限制向所有组成员递交组成员资格变化信息和应用消息的次序．为支持网络可划分的情况，引入了扩展虚拟同步模型．针对扩展虚拟同步模型的特点，提出了一种基于客户／服务器模式的组通信系统架构，并以I／O自动机的形式给出系统内部各模块的服务和算法．最后以继承建模的方式逐步给出该算法的自动机模型，并用形式化的方法验证其正确性．     

递阶混合控制系统的分析,综合与证明

提出两类离散事件域的自动机作为控制分析与综合的中间模型，基于广义受控对象的等价事件模型，递阶型的控制器可被系统地综合。为了保证系统分析和综合的正确性，利用Ｈｏａｒｅ逻辑得到一些验证规则。最后以一级倒立摆的控制为例加以说明。     

论CMM和CMMI中的测评技术

对软件的生产必须进行工程化的管理，这是早已取得的共识，但是如何对软件企业进行评估，并进一步提高软件的质量及其生产率，这则是亟待解决的问题．CMM和CMMI的制定解决了这一问题。软件的测试则是传统软件生产中的另一重要环节，文章重点讨论了CMM和CMMI的基本情况．并比较了测评在二者中作用．     

Parametric Analysis of Computer Systems

A general parametric analysis problem which allows the use of parameter variables in both the real-time automata and the specifications is proposed and solved. The analysis algorithm is much simpler and can run more efficiently in average cases than can previous works.     

关于I/O模拟的讨论

详细分析Windows的I/O机制,提出了分别在用户级、系统级、驱动级的I/O模拟操作,通过实际案例和源代码分享在I/O模拟上的得失,着重介绍鼠标与键盘的模拟。     

基于NOW的Collective I/O技术研究

随着ＮＯＷ在科学研究中白益广泛的应用,如何为ＮＯＷ上的科学计算提供高性能的输入输出成为我们面临的一个新课题。作者根据ＮＯＷ的特点,设计并实现了一个具有ＮＯＷ特色的基于ＣｏｌｌｅｃｔｉｖｅＩ／Ｑ的并行Ｉ／Ｏ系统,吸取了ＤＤＩＯ与ｔｗｏ－ｐｈａｓｅＩ／Ｏ的优点,从而有效地解决了高带宽和低延迟问题。初步的系统吞吐量测试显示了良好的性能。     

Mismatch in a predictor control scheme : some closed-form solutions

Problems of sub-plant mismatch, hitherto treated numerically, are considered. Closed-form solutions are obtained for the predictor scheme with sub-plant K/8, modelled by K'/8, where K'/8 takes arbitrary (positive) values not necessarily close to K. The case of a small mismatch in delay only of the same scheme is treated similarly. The paper concludes with a detailed treatment of sub-plant mismatch accompanied by simultaneous small mismatch in delay. This has implications, in particular, for the choice of sign of delay mismatch in the use of deliberate mismatch for the improvement of performance. The techniques of the paper are applicable to more general sub-plant accompanied, or not, by small mismatch in delay.     

Windows Vista、Windows7存储I/O优先化

微软操作系统中Windows Vista率先实现了I/O优先化技术,克服了PC的I/O瓶颈,有效地改善了系统的响应能力.文章提供了微软Windows操作系统有关I/O优先级技术信息,为应用程序设计、存储设备设计及系统维护提供了参考依据.     

客户机/服务器系统软件测试方法

对客户初／服务器系统软件进行有效测试是确保系统可靠工作的关键之一。文章主要分析了客户机／服务器系统的特点,提出了相应的测试方法,并给出了实例。     

数据库优化方案探讨

随着数据库技术应用领域的不断扩大,数据库系统能否正常、高效地运行倍受关注.本文以数据库性能优化的基本原则为出发点,对数据库性能优化进行了分析,阐述了影响数据库性能的主要因素,并就数据库优化方案进行了探讨.     

汇编语言I/O子程序库设计

设计的汇编语言子程序库可以被汇编程序或C 程序调用.实现不同数制的键盘输入和控制台显示.