On Performance Bounds for Interval Time Petri Nets
S. Bernardi, and J. Campos. Proceedings of the 1st International Conference on Quantitative Evaluation
of Systems (QEST'04), page 50-59. Enschede, The Netherlands, IEEE Computer Society, (September 2004)
DOI: 10.1109/QEST.2004.1348019
Abstract
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.
%0 Conference Paper
%1 BC-QEST-04
%A Bernardi, S.
%A Campos, J.
%B Proceedings of the 1st International Conference on Quantitative Evaluation
of Systems (QEST'04)
%C Enschede, The Netherlands
%D 2004
%I IEEE Computer Society
%K imported
%P 50-59
%R 10.1109/QEST.2004.1348019
%T On Performance Bounds for Interval Time Petri Nets
%U http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/bc-qest-04.pdf
%X 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.
@inproceedings{BC-QEST-04,
abstract = {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.},
added-at = {2017-05-12T16:10:55.000+0200},
address = {Enschede, The Netherlands},
author = {Bernardi, S. and Campos, J.},
biburl = {https://www.bibsonomy.org/bibtex/22127ce0cc2bc1c3e3f8f17da9728ce72/jcampos},
booktitle = {Proceedings of the 1st International Conference on Quantitative Evaluation
of Systems {(QEST'04)}},
doi = {10.1109/QEST.2004.1348019},
interhash = {946a67b6cc116e139bd5069055b7ff74},
intrahash = {2127ce0cc2bc1c3e3f8f17da9728ce72},
keywords = {imported},
month = {September},
pages = {50-59},
publisher = {IEEE Computer Society},
timestamp = {2017-05-12T16:10:55.000+0200},
title = {On Performance Bounds for Interval Time {Petri} Nets},
url = {http://webdiis.unizar.es/~jcampos/wordpress/wp-content/plugins/papercite/pdf/bc-qest-04.pdf},
year = 2004
}