Locked discrete event systems: How to model and how to unlock

To model qualitative aspects of discrete event systems, i.e., the order of the events is of sole importance, we use a triple consisting of the set of all possible events (the alphabet), the set of all behavior (possible strings of events), and the set of all tasks (completed behavior). We use this view to model synchronous as well as asynchronous connection of systems. Moreover, it is easy to define notions like deadlock and livelock in this view. We give a method to construct a second system that, in connection with the original system, gets rid of its deadlock and/or livelock. A state-space representation is introduced. In this representation computations can be done effectively.     

一种多粒度集群数据库并发控制新算法

为保证集群系统中全局事务的并发正确执行,采用基于谓词级的多级粒度冲突检测机制,并通过检测谓词冲突图中是否存在环的方法来避免冲突的全局事务可能会产生的全局死锁,不仅减小了死锁检测粒度,而且还提高了全局事务处理的并发度,同时也保持了集群中局部数据库的自治性。此外,还改进了一种以事务提交图为中心的并发事务调度算法来保证全局事务的可串行化提交,实验结果表明,该算法有效地提高了全局事务执行的并发度,增加了事务吞吐率和减少了响应时间。     

一种多线程软件并发漏洞检测方法

多线程软件由于进程间共享使用资源而极易发生死锁这一严重的并发漏洞.通过Petri网模型对多线程软件进行建模,并利用混合整数规划技术检测其漏洞.目前,使用互斥锁的多线程软件可通过Gadara网建模和检测.而使用信号量的多线程软件,虽可用S*PR网建模,但是尚未有理论支撑混合整数规划用于其漏洞检测.定义了S*PR网的一个子类——SEM-S*PR网,它允许资源库所初始标志大于1且分支可对称地使用资源,进而可建模一类使用信号量的多线程软件.依据结构特点,证明了该网保持活性的充分必要条件是网运行过程中所有信标始终非空.此结论是混合整数规划用于SEM-S*PR网建模的多线程软件的并发漏洞检测的理论基础.     

Method to compute the reachability set of S3PR

This paper proposes a novel approach to computing the reachability set by using place invariants and strict minimal siphons for S³PR with specific resource places. First, the set of invariant markings is enumerated. Then a necessary and sufficient condition is developed to decide whether a marking is spurious by analyzing the relationship between the number of tokens in the corresponding places of any strict minimal siphon and their bounds. In addition, the spurious markings are calculated. Finally, the reachability set of the net is generated by removing all the spurious markings from the set of invariant markings. Experimental results show the efficiency of the proposed method.     

基于动态探针的分布式死锁预防策略

数据库系统中事务死锁的检测和预防,对提高系统并发性和整体性能具有重要意义。在研究了现有的分布式数据库系统死锁预防策略的基础上,利用创建动态探针(DP)技术,提出了一种改进的死锁预防策略。该DP方法在创建探针后将其发往可能产生死锁的节点,接收到探针后,根据节点信息与探针所包含信息的比较结果,可以判断是否有死锁发生,从而达到预防死锁的目的。分析表明,该方法提高了死锁预防的有效性和系统资源的利用率。     

并行测试技术及在导弹测试中的应用研究

并行测试技术是将并行处理技术引进自动测试领域形成的一种先进的测试技术和方法,拥有减少测试时间、降低测试成本的强大优势,正成为研究热点之一;首先介绍了并行测试的基本概念,分析对比了几种实现并行测试的软硬件方法及基本结构体系;然后结合导弹传统串行测试方法的不足及未来战场快速测试的要求,设计了一种导弹的网络化并行测试的基本结构;最后,针对并行测试技术在导弹测试中的应用,提出了需要注意的任务调度、死锁预防及并行测试接口设计等几点关键技术和导弹并行测试系统组建原则。     

分布式移动代理系统的异步死锁检测

移动代理技术在为分布式应用提供全新的网络计算方式的同时也产生了传统分布式计算领域所没有的新的交互模式和执行模式。传统分布式计算的处理方法如并发控制和死锁检测方法不再适用于客户和服务提供者都可在网络中随处移动的移动代理系统。通过移动代理来建模长寿事务,并根据移动代理的特点提出了一种异步分布式死锁检测和解除算法。它将事务代理的执行与死锁检测机制分离,用专门的代理负责死锁检测的初始化、检测和消除等工作。死锁的检测通过创建若干检测代理,使其在各个站点间移动来收集资源请求和分配信息,并据此构造全局等待图;通过分析和探测全局等待图中是否存在圈来完成。算法具有独立于网络的拓扑结构,死锁的检测和事务代理的执行异步操作,不对代理的移动性施加任何限制等特点。     

Design of liveness‐enforcing supervisors via transforming plant petri net models of FMS

This paper focuses on the deadlock prevention problems in a class of Petri nets, systems of simple sequential process with resources, S³PR for short. By structure analysis, we propose an approach that can transform a plant net model into a weighted S³PR (WS³PR) that is behaviorally equivalent to the plant model. The WS³PR is made to be live by properly reconfiguring its weight distribution such that its all strict minimal siphons are self‐max'‐controlled. The resulting WS³PR can serve as a liveness‐enforcing Petri net supervisor for the plant model after removing some idle and operation places. A live controlled system can be accordingly obtained by synchronizing a plant model and the places whose weights are regulated. This research shows that a small number of monitors is obtained, leading to more permissive behavior of the controlled system. Examples are used to demonstrate the proposed concepts and methods. Copyright © 2010 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Extension of the lower bound of monitor solutions of maximally permissive supervisors to non-α net systems

Traditional region-based liveness-enforcing supervisors focus on (1) maximal permissiveness of not losing legal states, (2) structural simplicity of minimal number of monitors, and (3) fast computation. Lately, a number of similar approaches can achieve minimal configuration using efficient linear programming. However, it is unclear as to the relationship between the minimal configuration and the net structure. It is important to explore the structures involved for the fewest monitors required. Once the lower bound is achieved, further iteration to merge (or reduce the number of) monitors is not necessary. The minimal strongly connected resource subnet (i.e., all places are resources) that contains the set of resource places in a basic siphon is an elementary circuit. Earlier, we showed that the number of monitors required for liveness-enforcing and maximal permissiveness equals that of basic siphons for a subclass of Petri nets modelling manufacturing, called α systems. This paper extends this to systems more powerful than the α one so that the number of monitors in a minimal configuration remains to be lower bounded by that of basic siphons. This paper develops the theory behind and shows examples.     

操作系统中的死锁检测

本文提供了一种检测操作系统中死锁的方法．该方法包含三个步骤：（1）通过检测进程加锁与解锁是否匹配来获得锁的持有者;（2）从异常进程中筛选出锁的等待者;（3）通过检查锁的持有者与等待者是否会形成循环等待图来判定死锁．通过实验发现,该方法对系统性能的影响小于l％,而且不需要修改内核源码和源程序．