On performance bounds for interval time petri nets

Interval time Petri nets are Petri nets in which time intervals are associated to transitions. Their quantitative analysis basically consists in applying enumerative techniques that suffer the well known state space explosion problem. To overcome this problem several methods have been proposed in the literature, that either allow to obtain equivalent nets with a reduced state space or avoid the construction of the whole state space. The alternative method proposed here consists in computing performance bounds to partially characterize the quantitative behavior of interval time Petri nets by exploiting their structural properties and/or by applying operational laws. The performance bound computation is not a new technique: it has been proposed for timed Petri nets. In this paper we present the results obtained from a preliminary investigation on the applicability of bounding techniques of timed Petri nets to interval time Petri nets.

[1]  Guy Juanole,et al.  Functional and Performance Analysis Using Extended Time Petri Nets , 1987, Petri Nets and Performance Models.

[2]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[3]  Giovanni Chiola,et al.  Operational analysis of timed Petri nets and application to the computation of performance bounds , 1993, Proceedings of 5th International Workshop on Petri Nets and Performance Models.

[4]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[5]  Manuel Silva Suárez,et al.  Structural techniques and performance bounds of stochastic Petri net models , 1992, Advances in Petri Nets: The DEMON Project.

[6]  M. Diaz,et al.  Modeling and Verification of Time Dependent Systems Using Time Petri Nets , 1991, IEEE Trans. Software Eng..

[7]  Manuel Silva,et al.  Properties and performance bounds for closed free choice synchronized monoclass queueing networks , 1991 .

[8]  Jiacun Wang,et al.  Timed Petri Nets , 1998, The Kluwer International Series on Discrete Event Dynamic Systems.

[9]  Bernard Berthomieu,et al.  An Enumerative Approach for Analyzing Time Petri Nets , 1983, IFIP Congress.

[10]  Marco Ajmone Marsan,et al.  The Effect of Execution Policies on the Semantics and Analysis of Stochastic Petri Nets , 1989, IEEE Trans. Software Eng..

[11]  Zhen Liu,et al.  Performance Analysis of Stochastic Timed Petri Nets Using Linear Programming Approach , 1995, IEEE Trans. Software Eng..

[12]  A. Bobbio,et al.  Kronecker representation of stochastic Petri nets with discrete PH distributions , 1998, Proceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248).

[13]  Giovanni Chiola,et al.  Properties and Performance Bounds for Timed Marked Graphs , 1992 .

[14]  Louchka Popova-Zeugmann,et al.  On Time Petri Nets , 1991, J. Inf. Process. Cybern..

[15]  Edward D. Lazowska,et al.  Quantitative system performance - computer system analysis using queueing network models , 1983, Int. CMG Conference.

[16]  Gianfranco Balbo,et al.  Performance Models for Discrete Event Systems with Synchronizations: Formalisms and Analysis Techniques , 1998 .

[17]  Guy Juanole,et al.  Dealing with arbitrary time distributions with the stochastic timed Petri net model-application to queueing systems , 1991, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91.

[18]  Louchka Popova-Zeugmann,et al.  Analyzing Paths in Time Petri Nets , 1999, Fundam. Informaticae.