Using rainbow net simulation to measure fault tolerance in a multiprocessor

The Rainbow net simulation technique is applied to modelling the impact of system load and fault handling on the availability of a fault-tolerant multiprocessor architecture. Rainbow nets are described along with the motivation for creating this modelling technique. A Rainbow net fault-handling model is created for the fault-tolerant multiprocessor architecture and the topology is shown to remain constant in size, independent of the number of processor, memory and I/O elements configured in the system. Simulation is performed with a varying load in terms of the number of active jobs the system must support. Results are given showing how the fault-tolerant capability varies with load. Two new metrics for evaluating fault tolerance are introduced; namely full fault-tolerability and partial fault-tolerability. They are based on simple observations in the model.     

Petri网与数字系统设计

日益复杂的数字系统设计,须由各种专业的设计人员分工完成。他们之间需要一种描述系统的“共同语言”来沟通,这对于提高设计质量、缩短设计周期、减少设计费用具有积极意义。Petri网十分适合担任这一“共同语言”的角色。文章给出了数字电路测试仪器中的硬件设计的部分实例。     

Reachability determination in acyclic Petri nets by cell enumeration approach

Reachability is one of the most important behavioral properties of Petri nets. We propose in this paper a novel approach for solving the fundamental equation in the reachability analysis of acyclic Petri nets, which has been known to be NP-complete. More specifically, by adopting a revised version of the cell enumeration method for an arrangement of hyperplanes in discrete geometry, we develop an efficient solution scheme to identify firing count vector solution(s) to the fundamental equation on a bounded integer set, with a complexity bound of O((nu)^n−m), where n is the number of transitions, m is the number of places and u is the upper bound of the number of firings for all individual transitions.     

构建基于XML的在线备忘录

XML能够使用得Internet上的数据交换变得更方便,XML与数据库一样,都能够作为信息存储的途径。当数据量不大的时候,比如完成一个在线备忘录,XML作为数据存储具有关系数据库所无法比拟的优势。在asp.net中能够利用.net类库提供的类及方法轻松地构建一个基于XML的在线备忘录。     

Expansion of a matrix in terms of external products of configuration vectors

The paper proposes a neural-net iterative algorithm that allows us to represent any random symmetrical N×N matrix as a weighted Hebbian series of configuration vectors with a given accuracy. The iterative algorithm is shown to demonstrate the fastest convergence when the vectors of expansion are stable nods of the N-dimensional space corresponding to the extremums of the neural-net energy functional. It so proves that all conclusions about neural networks and optimization algorithms that are based on Hebbian matrices are true for any other type of matrix. The text was submitted by the author in English.     

A multi-agent intelligent system for efficient ERP maintenance

The Enterprise Resource Planning (ERP) system is an enterprise-wide integrated software package designed to uphold the highest quality standards of business process. However, for the time being, when the business condition has been changed, the system may not guarantee that the process embedded in ERP is still best. Moreover, since the ERP system is very complex, maintaining the system by trial and error is very costly. Hence, this paper aims to construct a support system that adjusts ERP system to environmental changes. To do so, we adopt multi-agent intelligent technology that enables autonomous cooperation with one another to monitor ERP databases and to find any exceptional changes and then analyze how the changes will affect ERP performance. Moreover, Petri net is applied to manage the complexity and dynamics of agents’ behavior. To show the feasibility of the idea, a prototype agent system, ERP/PN, is proposed and an experiment is conducted.     

Iterative analysis of Markov regenerative models

Conventional algorithms for the steady-state analysis of Markov regenerative models suffer from high computational costs which are caused by densely populated matrices. In this paper, a new algorithm is suggested which avoids computing these matrices explicitly. Instead, a two-stage iteration scheme is used. An extended version of uniformization is applied as a subalgorithm to compute the required transient quantities “on-the fly”. The algorithm is formulated in terms of stochastic Petri nets. A detailed example illustrates the proposed concepts.     

软件编程构造和实现Petri Nets可达树

采用数据结构的思想和一些算法,将C 中的一些优良特性应用到Matlab编程语言中,用Matlab编程语言编程实现了PetriNets的可达树的构造。该程序对Petri Nets系统的动态性能分析具有一定的参考价值。