ACM Transactions on Computer Systems (TOCS)
Petri nets: an introduction
IEEE Transactions on Software Engineering
Concurrent and maximally concurrent evolution of nonsequential systems
Theoretical Computer Science
Advances in Petri Nets 1984
Tools for efficient analysis of conurrent software systems
Proceedings of the second conference on Software development tools, techniques, and alternatives
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
A Generalized Timed Petri Net Model for Performance Analysis
International Workshop on Timed Petri Nets
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
Extended Stochastic Petri Nets: Applications and Analysis
Performance '84 Proceedings of the Tenth International Symposium on Computer Performance Modelling, Measurement and Evaluation
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
The Design of a Unified Package for the Solution of Stochastic Petri Net Models
International Workshop on Timed Petri Nets
The derivation of performance expressions for communication protocols from timed petri net models
SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Distributed dynamic hash tables using IBM LAPI
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
| Hi-index | 0.00 |
It is shown that the behavior of timed Petri nets with deterministic firing times (D-timed nets) and with exponentially distributed random firing times (M-timed nets) can be described within one uniform formalism. Moreover, for both classes of nets the state spaces are homogeneous semi-Markov chains, the stationary probabilities of states and many performance measures can thus be obtained by standard techniques developed for analysis of Markov processes. Because of scarcity of nets as well as corresponding systems of equilibrium equations, list structure representations are proposed, and a general procedure for generation of the state space is outlined to show the required processing of list structures.