Upper and lower bounds for stochastic marked graphs (Q1321817): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(94)90102-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080077417 / rank | |||
Normal rank | |||
Revision as of 19:43, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper and lower bounds for stochastic marked graphs |
scientific article |
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
