ACM Transactions on Computer Systems (TOCS)
Analytic Queueing Network Models for Parallel Processing of Task Systems
IEEE Transactions on Computers
Performance models of multiprocessor systems
Performance models of multiprocessor systems
Advances in Petri nets 1986, part I on Petri nets: central models and their properties
IEEE Transactions on Computers
Necessary and Sufficient Ergodicity Condition for Open Synchronized Queueing Networks
IEEE Transactions on Software Engineering
Product Form Approximations for Queueing Networks with Multiple Servers and Blocking
IEEE Transactions on Computers
Detection of Ada Static Deadlocks Using Petri Net Invariants
IEEE Transactions on Software Engineering
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
ADA Programming Language
Predicting Performance of Parallel Computations
IEEE Transactions on Parallel and Distributed Systems
Analysis of Fork-Join Program Response Times on Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
On Stochastic High-Level Petri Nets
PNPM '87 The Proceedings of the Second International Workshop on Petri Nets and Performance Models
Aggregation Methods in Exact Performance Analyssi of Stochastic Petri Nets
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Aggregation of States in Colored Stochastic Petri Nets: Application to a Multiprocessor Architecture
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Performance Evaluation Using Unbounded Timed Petri Nets
PNPM '89 The Proceedings of the Third International Workshop on Petri Nets and Performance Models
Proceedings of the 10th International Conference on Applications and Theory of Petri Nets: Advances in Petri Nets 1990
On the integration of delay and throughput measures in distributed processing models
On the integration of delay and throughput measures in distributed processing models
Representation and analysis of behavior for multiprocess systems by using stochastic Petri nets
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.01 |
Methods of calculating efficiently the performance measures of parallel systems by using unbounded generalized stochastic Petri nets are presented. An explosion in the number of states to be analyzed occurs when unbounded places appear in the model. The state space of such nets is infinite, but it is possible to take advantage of the natural symmetries of the system to aggregate the states of the net and construct a finite graph of lumped states which can easily be analyzed. With the methods developed, the unbounded places introduce a complexity similar to that of safe places of the net. These methods can be used to evaluate models of open parallel systems in which unbounded places appear; systems which are k-bounded but are complex and have large values of k can also be evaluated in an appropriate way. From the steady-state solution of the model, it is possible to obtain automatically the performance measures of parallel systems represented by this type of net.