1st International ICST Conference on Performance Evaluation Methodologies and Tools

Research Article

Approximate closed-form aggregation of a fork-join structure in generalised stochastic petri nets

  • @INPROCEEDINGS{10.1145/1190095.1190136,
        author={Nimrod  Lilith and Jonathan  Billington and Jorn  Freiheit},
        title={Approximate closed-form aggregation of a fork-join structure in generalised stochastic petri nets},
        proceedings={1st International ICST Conference on Performance Evaluation Methodologies and Tools},
        publisher={ACM},
        proceedings_a={VALUETOOLS},
        year={2012},
        month={4},
        keywords={},
        doi={10.1145/1190095.1190136}
    }
    
  • Nimrod Lilith
    Jonathan Billington
    Jorn Freiheit
    Year: 2012
    Approximate closed-form aggregation of a fork-join structure in generalised stochastic petri nets
    VALUETOOLS
    ACM
    DOI: 10.1145/1190095.1190136
Nimrod Lilith1,*, Jonathan Billington1,*, Jorn Freiheit2,*
  • 1: Computer Systems Engineering Centre (CSEC), University of South Australia, Mawson Lakes, Australia.
  • 2: Max-Planck-Institute, Saarbrucken, Germany.
*Contact email: Nimrod.Lilith@unisa.edu.au, Jonathan.Billington@unisa.edu.au, freiheit@mpi-sb.mpg.de

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.