Approximate throughput computation of stochastic marked graphs

A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented. It generalizes a previous technique based on net decomposition through a single input-single output cut, allowing the split of the model through any cut. The approach has...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on software engineering 1994-07, Vol.20 (7), p.526-535
Hauptverfasser:	Campos, J., Colom, J.M., Jungnitz, H., Silva, M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Approximation Approximation methods Computational modeling Computer science control theory systems Computer systems performance. Reliability Decomposition Delay Exact sciences and technology Iterative methods Performance analysis Proposals Queueing analysis Response time Software State-space methods Stochastic processes Studies Systems development Techniques Throughput
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!