%0 Conference Paper %1 CCCS-Roma-93 %A Chiola, G. %A Campos, J. %A Colom, J.M. %A Silva, M. %B Proceedings of the 16th International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance'93) %C Roma, Italy %D 1993 %K imported jcampos %T Operational Analysis of Timed Petri Nets %X Operational analysis is a conceptually very simple way of deriving mathematical equations relating measurable quantities in queueing systems DB 78. In DC 92 the reader can find some nice examples of how the application of operational analysis techniques can help in explaining and proving fundamental results in queueing network analysis. Here we apply operational analysis techniques to derive linear equations and inequalities relating interesting performance measures in timed Petri net models. The main conceptual difference between queueing and Petri net models is the presence of a synchronization primitive in the latter. New operational inequalities are derived for synchronization elements that have no counterpart in operational laws for queueing networks. In addition to the mathematical interest of these derivations, the results can be immediately used for the computation of performance bounds based on linear programming techniques.

@inproceedings{CCCS-Roma-93, abstract = {Operational analysis is a conceptually very simple way of deriving mathematical equations relating measurable quantities in queueing systems [DB 78]. In [DC 92] the reader can find some nice examples of how the application of operational analysis techniques can help in explaining and proving fundamental results in queueing network analysis. Here we apply operational analysis techniques to derive linear equations and inequalities relating interesting performance measures in timed Petri net models. The main conceptual difference between queueing and Petri net models is the presence of a synchronization primitive in the latter. New operational inequalities are derived for synchronization elements that have no counterpart in operational laws for queueing networks. In addition to the mathematical interest of these derivations, the results can be immediately used for the computation of performance bounds based on linear programming techniques.}, added-at = {2017-05-12T16:10:55.000+0200}, address = {Roma, Italy}, author = {Chiola, G. and Campos, J. and Colom, J.M. and Silva, M.}, biburl = {https://www.bibsonomy.org/bibtex/292b9b022800610623dcb69d968fb1814/jcampos}, booktitle = {Proceedings of the 16th International Symposium on Computer Performance Modelling, Measurement and Evaluation (Performance'93)}, interhash = {865b705a1b01fee7607d10f0398e395e}, intrahash = {92b9b022800610623dcb69d968fb1814}, keywords = {imported jcampos}, month = {September}, timestamp = {2017-05-15T11:48:08.000+0200}, title = {Operational Analysis of Timed {Petri} Nets}, year = 1993 }