Upper and lower bounds for stochastic marked graphs (Q1321817)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Upper and lower bounds for stochastic marked graphs |
scientific article; zbMATH DE number 561599
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounds for stochastic marked graphs |
scientific article; zbMATH DE number 561599 |
Statements
Upper and lower bounds for stochastic marked graphs (English)
0 references
16 April 1996
0 references
A form of recurrence relations is used to derive efficiently computable bounds on the rate of strongly connected SMGS (stochastic marked graphs).
0 references
stochastic marked graphs
0 references
Petri nets
0 references
distributed computing
0 references
performance evaluation
0 references
recurrence relations
0 references
0 references
