| On The Relations Between Bcmp Queueing Networks And Product Form Solution Stochastic Petri Nets | 7 | 0.52 | 2003 |
| Embedded Processes in Generalized Stochastic Petri Nets | 1 | 0.36 | 2001 |
| Self-Stabilizing Algorithms for Finding Centers and Medians of Trees | 22 | 1.00 | 1999 |
| Self-stabilizing algorithms for finding centers and medians of trees | 20 | 1.06 | 1994 |
| A generalized hold model | 5 | 0.73 | 1993 |
| Mutual exclusion on a hypercube | 0 | 0.34 | 1993 |
| Experience with concurrent simulation | 8 | 4.47 | 1989 |
| An Example of Validation and Evaluation ofa Concurrent Program: Lamport's Fast Mutual Exclusion Algorithm | 0 | 0.34 | 1989 |
| Alternative Methods for Incorporating Non-exponential Distributions into Stochastic Timed Petri Nets | 11 | 0.78 | 1989 |
| Throughput Bounds for Generalized Stochastic Petri Net Models | 5 | 0.71 | 1985 |
| Mean-Value Analysis Of Mixed, Multiple Class Bcmp Networks With Load Dependent Service Stations | 18 | 1.11 | 1984 |
| Proceedings of the International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 1983, August 29-31, 1983, Minneapolis, Minnesota, USA | 23 | 12.71 | 1983 |
| Computational Aspects Of Aggregation In Multiple Class Queuing-Networks | 10 | 1.19 | 1983 |
| Modeling a new technique for accessing shared buses | 5 | 0.50 | 1982 |
| Aggregation in Multiclass Queueing Networks | 1 | 0.47 | 1981 |
| Customer Classes and Closed Network Models-A Solution Technique | 5 | 2.85 | 1977 |
| When to stop a simulation run: A case study | 1 | 0.70 | 1976 |
