M. Ajmone Marsan
ABSTRACT
Graph models have been proposed by many authors as a useful tool for the analysis of peculiar features of computer systems such as concurrency, synchronization, communication, and cooperation among subsystems. Much of the work in this field is related to the original ideas developed by C. A. Petri. These graph models are today generally known as Petri Nets (PNs).
- 1.Peterson, J.L. "Petri Nets", ACM Computing Surveys, Vol.9, n.3, (September 1977). Google Scholar
Digital Library
- 2.Molloy, M.K. "Performance Analysis Using Stochastic Petri Nets" IEEE Trans. on Computers, (September 1982).Google ScholarDigital Library
Index Terms
- A class of generalised stochastic petri nets for the performance evaluation of multiprocessor systems
Recommendations
Discrete Time Stochastic Petri Nets
Basic graph models of processes, such as Petri nets, have usually omitted the concept of time as a parameter. Time has been added to the Petri net model in two ways. The timed Petri net (TPN) uses a fixed number of discrete time intervals. The ...
New NP-Complete Problems in Performance Evaluation of Concurrent Systems Using Petri Nets
Timed Petri nets are useful in performance evaluation of concurrent systems. The maximum computation rate is achieved for minimal cycle time of timed Petri net. It is known that minimal cycle time problem for P-invariant Petri nets is NP-complete. In ...
Extended elementary siphon-based deadlock prevention policy for a class of generalised Petri nets
This paper develops a novel deadlock prevention policy for a class of generalised Petri nets, namely S4PR that can well model flexible manufacturing systems FMS. The analysis of generalised Petri nets leads us to characterise deadlock situations in ...
Comments