Flow analysis of stochastic marked graphs
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1528-1531
- https://doi.org/10.1109/cdc.1989.70403
Abstract
The discrete-event systems called stochastic marked graphs (SMGs) are investigated from a stability point of view. Being a special class of timed Petri nets with stochastic firing times, they are studied under the assumption of ergodicity of flow of their free strongly connected components, which is a milder behavior assumption than that of Markovian behavior. The asymptotic behavior of SMGs at large times (steady state) is studied, and the average flow of tokens in the system is specified.Keywords
This publication has 8 references indexed in Scilit:
- Necessary and sufficient ergodicity condition for open synchronized queueing networksIEEE Transactions on Software Engineering, 1989
- Palm Probabilities and Stationary QueuesLecture Notes in Statistics, 1987
- Performance Evaluation of Asynchronous Concurrent Systems Using Petri NetsIEEE Transactions on Software Engineering, 1980
- Petri NetsACM Computing Surveys, 1977
- Circuit theoretic analysis and synthesis of marked graphsIEEE Transactions on Circuits and Systems, 1977
- Marked directed graphsJournal of Computer and System Sciences, 1971
- Scheduling Parallel ComputationsJournal of the ACM, 1968
- Properties of a Model for Parallel Computations: Determinacy, Termination, QueueingSIAM Journal on Applied Mathematics, 1966