QPN-Tool for the Specification ans Analysis of Hierarchically Combined Queueing Petri Nets

This article describes a new version of the QPN-Tool now supporting specification and analysis of hierarchically combined Queueing Petri nets (HQPNs). HQPNs are an extension of QPNs allowing the refinement of places by QPN subnets and/or queues. HQPNs can be analysed with respect to qualitative and quantitative aspects. Quantitative analysis is based on numerical Markov chain analysis. In contrast to conventional techniques the Markov chain underlying a HQPN is analysed by an approach exploiting the hierarchical structure of the model which results in a tensor representation of the generator matrix. This technique extends the size of solvable state spaces by one order of magnitude. Qualitative analysis of HQPNs relies on efficient analysis techniques based on Petri net theory. The new version of QPN-Tool implements the above analysis approaches supported by a graphical interface for a convenient specification of complex models.

[1]  Manuel Silva,et al.  A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[2]  Günter Hommel,et al.  TimeNET: A Toolkit for Evaluating Non-Markovian Stochastic Petri Nets , 1995, Perform. Evaluation.

[3]  Peter Huber,et al.  Hierarchies in coloured Petri nets , 1991, Applications and Theory of Petri Nets.

[4]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[5]  Marco Ajmone Marsan,et al.  Performance models of multiprocessor systems , 1987, MIT Press series in computer systems.

[6]  Falko Bause,et al.  QPN -Tool for Qualitative and Quantitative Analysis of Queueing Petri Nets , 1994, Computer Performance Evaluation.

[7]  Falko Bause,et al.  Queueing Petri Nets-A formalism for the combined qualitative and quantitative analysis of systems , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[8]  Christoph Lindemann,et al.  DSPNexpress: A Software Package for the Efficient Solution of Deterministic and Stochastic Petri Nets , 1993, Perform. Evaluation.

[9]  Kishor S. Trivedi,et al.  SPNP: stochastic Petri net package , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[10]  Gianni Conte,et al.  PERFORMANCE ANALYSIS OF MULTIPROCESSOR SYSTEMS , 1985 .

[11]  Peter Buchholz,et al.  Hierarchically combined queueing Petri nets , 1994 .

[12]  Falko Bause,et al.  SDL and Petri net performance analysis of communicating systems , 1995, PSTV.

[13]  Daniel A. Reed,et al.  Experimental Analysis of Parallel Systems: Techniques and Open Problems , 1994, Computer Performance Evaluation.

[14]  Giovanni Chiola,et al.  Stochastic Well-Formed Coloured Nets and Multiprocessor Modelling Applications , 1991 .

[15]  Susanna Donatelli,et al.  Superposed Generalized Stochastic Petri Nets: Definition and Efficient Solution , 1994, Application and Theory of Petri Nets.

[16]  Peter Buchholz Aggregation and reduction techniques for hierarchical GCSPNs , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[17]  M.A. Qureshi,et al.  The UltraSAN Modeling Environment , 1995, Perform. Evaluation.

[18]  K. Lautenback Linear algebraic calculation of deadlocks and traps , 1987 .

[19]  H. Beilner,et al.  Towards a Performance Modelling Environment: News on Hit , 1989 .

[20]  Peter Buchholz,et al.  A Hierarchical View of GCSPNs and Its Impact on Qualitative and Quantitative Analysis , 1992, J. Parallel Distributed Comput..

[21]  Giovanni Chiola,et al.  Stochastic Well-Formed Colored Nets and Symmetric Modeling Applications , 1993, IEEE Trans. Computers.

[22]  Peter Buchholz,et al.  A class of hierarchical queueing networks and their analysis , 1994, Queueing Syst. Theory Appl..

[23]  Jean-Michel Fourneau,et al.  PEPS: A Package for Solving Complex Markov Models of Parallel Systems , 1989 .

[24]  Peter Kemper,et al.  Linear Time Algorithm to Find a Minimal Deadlock in a Strongly Connected Free-Choice Net , 1993, Application and Theory of Petri Nets.