de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Konferenzbeitrag

Approximate Closed-Form Aggregation of a Fork-Join Structure in Generalised Stochastic Petri Nets

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44443

Freiheit,  Jörn
Automation of Logic, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Lilith, N., Billington, J., & Freiheit, J. (2006). Approximate Closed-Form Aggregation of a Fork-Join Structure in Generalised Stochastic Petri Nets. In L. Lenzini, & R. L. Cruz (Eds.), Proceedings of the 1st International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS 2006 (pp. 1-10). New York, USA: ACM.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-000F-24BA-A
Zusammenfassung
In this paper an aggregation technique for generalised stochastic Petri nets (GSPNs) possessing synchronised parallel structures is presented. Parallel processes featuring synchronisation constraints commonly occur in fields such as product assembly and computer process communications, however their existence in closed networks severely complicates analysis. This paper details the derivation of computationally-simple closed-form expressions which permit the aggregation of a GSPN subnet featuring a fork-join structure. The aggregation expressions presented in this paper do not require the generation of the underlying continuous time Markov chain of the original net, and do not follow an iterative procedure. The resulting aggregated GSPN accurately approximates the stationary token distribution behaviour of the original net, and this is shown by the analysis of a number of example GSPNs.