de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44443

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

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

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.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-24BA-A
Abstract
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.