Network Simulation Environment (NSE): A Generic Framework for Network Graphs

A Network Simulation Environment (NSE) tool for identifying various routes within the network graphs based on clustering concept is proposed. The proposed tool is designed using object-oriented approach in Microsoft Windows environment. It allows the user to create, modify and display network graphs. One of the main features of the simulation package is the visualisation of the clustering of the graph to the acyclic level. It shows the step by step clustering of the network graph. The reverse process of unclustering is also featured in the proposed package. It offers a generic framework for comparing different types of routing algorithms by computing routing times and many other attributes for various algorithms. In addition, the simulation package provides facilities for printing and saving the network graphs.     

Program verification for microprocessors through Petri net modeling

Program verification forms an important part of the developmental process in the design of a microprocessor system to suit a particular application. The concepts of Petri nets are utilized to obtain a model of a microprocessor system which is suitable for program verification. The reachability and firing characteristics of Petri nets are useful and powerful tools for studying the dynamic behaviour of the modeled system at various levels of abstraction. The Petri net representation of different types of independent modules in the system is obtained through an appropriate interpretation. On the basis of these representations, the modeled system may be analysed to study the dynamic behaviour of the program.     

Simplification of Boolean functions through petri nets

A technique exploiting the modern concepts of Petri nets for simplification of Boolean functions is proposed. The firing concept of Petri nets has been utilized to give a Petri net interpretation to certain properties of switching algebra. These Petri net interpreted properties are then used for the simplification process. Unlike the existing method, the proposed technique does not require the functions to be expressed explicitly in a canonical form. This alleviates the computational efforts. It is simple and amenable for computer programming implementation.     

On the determination of all tie sets and minimal cut sets between any two nodes of a graph through Petri nets

A technique utilizing the reachability concept of Petri nets is proposed to determine all the tie sets and the minimal cut sets between two specified nodes in a graph. The proposed technique is novel in the sense that it requires only vector additions on a single matrix as compared to a large number of steps required in the existing techniques. This alleviates the computational problems and memory requirements.     

The use of Petri nets to analyze coherent fault trees

The use of Petri nets to represent fault trees is discussed. Using reachability and other analytic properties of Petri nets, a more general and useful method to study the dynamic behavior of the model at various levels of abstraction is examined. The problems of fault-detection and propagation are discussed. For simplicity, only coherent fault trees are considered. However, the representation and analysis techniques are general and can be used for noncoherent fault trees