Upper and lower bounds for stochastic marked graphs
- 22 March 1994
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 49 (6) , 291-295
- https://doi.org/10.1016/0020-0190(94)90102-3
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Unison, canon, and sluggish clocks in networks controlled by a synchronizerTheory of Computing Systems, 1995
- On the performance of synchronized programs in distributed networks with random processing times and transmission delaysIEEE Transactions on Parallel and Distributed Systems, 1994
- Complexity of network synchronizationJournal of the ACM, 1985
- A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturingIEEE Transactions on Automatic Control, 1985
- Performance Analysis Using Stochastic Petri NetsIEEE Transactions on Computers, 1982
- Performance Evaluation of Asynchronous Concurrent Systems Using Petri NetsIEEE Transactions on Software Engineering, 1980
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- Marked directed graphsJournal of Computer and System Sciences, 1971
- Scheduling Parallel ComputationsJournal of the ACM, 1968