A Graphical petri nets simulator

This thesis is an application software system (Graphical Petri Net simulator GPNS) providing a window-oriented, menu-driven and graphical interface simulator for Petri nets. This simulator is based on Place/Transition nets (PT-nets). It allows users to design and simulate PT-net under an interactive graphical environment. GPNS also provides a utility, Auxiliary Application Program (AAP), to make it more useful. When applying the AAP with the GPNS, each function in the AAP can be attached to a corresponding transition in the Petri net. Whenever an enabled transition in the Petri Net is fired will cause the corresponding function in the AAP to be executed. In this case, It is closer to a Predicate/Action net than a Place/Transition net, except that no predicates are attached. This Petri Net simulator can be a very good tutorial tool in an educational environment. Subject to some restrictions, it can be a very useful tool for modeling and designing a system

A Colored Petri Net-Based Approach for Automated Deadlock Detection in Parallel Programs

A static analysis approach is proposed for automated detection of deadlocks in a common class of parallel programs, referred to as Single Code Multiple Data (SCMD) programs. It is based on colored Petri net (CP-net) modeling and reachability analysis, where colors correspond to parallel processes. An SCMD program is first translated into a CP-net and a reachability tree is then derived and analyzed for deadlock information. CP-subnets representing basic programming language constructs are described. These subnets are employed as building blocks by an algorithm that translates synchronization-related statements of a process in an SCMD program and connects the resulting subnets. The connection technique makes use of the characteristics of SCMD programs to produce a unified and folded CP-net model. These characteristics are also used to introduce a notion, referred to as poset-covering, that leads to a reduced reachability tree for the Cp-net. The usual algorithm for generating and analyzing reachability trees of CP-nets is modified by including poset-covering and excluding notions that are irrelevant to our application. The compactness of the CP-net model and the reachability tree makes the proposed approach appealing for practical implementation

A graphical environment for the simulation of Petri nets

Call number: LD2668 .T4 CMSC 1988 T36Master of ScienceComputing and Information Science

Petri net modelling of a communications protocol

The Petri net is a formal modelling tool applicable to distributed systems and communication protocols. Two methods of analysis are applied to formal models of the "Alternating Bit Protocol". (i) A timed Petri net model is simulated to measure protocol performance. (ii) A modular numeric Petri net model is validated by reachability analysis. The simulation and validation tools are programmed in (i) "C" language and (ii) Prolog. A specification language "Needle" is developed. It describes the model system as a hierarchy of modular state transition networks. The model is searched for all possible event sequences, and the result displayed as a reachability tree. The specification language is capable of describing models which execute backwards in simulation time. The modular numeric Petri net is the basis of a powerful computer architecture, capable of parsing its own specification language to build complex models. Attention is drawn to the similarities between Petri net theory and quantum mechanics