ACM Transactions on Computer Systems (TOCS)
Discrete Time Stochastic Petri Nets
IEEE Transactions on Software Engineering
An Approach to Performance Specification of Communication Protocols Using Timed Petri Nets
IEEE Transactions on Software Engineering
A Generalized Timed Petri Net Model for Performance Analysis
IEEE Transactions on Software Engineering
Stochastic High-Level Petri Nets and Applications
IEEE Transactions on Computers
Stochastic Petri Net Representation of Discrete Event Simulations
IEEE Transactions on Software Engineering
M-timed Petri nets, priorities, preemptions, and performance evaluation of Petri nets
Advances in Petri Nets 1985, covers the 6th European Workshop on Applications and Theory in Petri Nets-selected papers
On Petri nets with deterministic and exponentially distributed firing times
Advances in Petri Nets 1987, covers the 7th European Workshop on Applications and Theory of Petri Nets
| Hi-index | 0.00 |
A Petri net is a graphical and mathematical modeling tool useful in the analysis of concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic systems. In addition, interest in Petri nets is increasing in the software community to model the behavior of parallel computer programs. The introduction of timed Petri nets allows system or program performance to be estimated as well.This paper begins with a general discussion, including definitions, for both ordinary and timed Petri nets. Several analysis tools are outlined for ordinary and timed Petri nets including analysis of the incidence matrix, coverability tree, firing diagram, and the GRID (Graph of Reachable Instantaneous Descriptions).This paper then introduces a method for representing Petri nets in APL2 and defines an easy input method. An APL2 implementation of each of the above analysis tools is given. These functions are described in detail as to their operation. Several examples of their use are given including examples of deadlock detection and performance estimation.