A tool support for automatic analysis based on the tagged customer approach

Bodrog, Levente; Horváth, Gábor; Rácz, Sándor; Telek, Miklós

doi:10.1109/qest.2006.2

Cited by 3 publications

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

First Passage Time Computation in Tagged GSPNs with Queue Places

Balbo¹,

Beccuti²,

Pierro³

et al. 2010

The Computer Journal

View full text Add to dashboard Cite

This paper presents an extension of the Generalized Stochastic Petri Net (GSPN) formalism that enables the computation of first passage time distributions. The tagged customer technique typical of queuing networks is adapted to the GSPN context by providing a formal definition and an automatic computation of the groups of tokens that can be identified as customers, i.e. classes of homogeneous entities behaving in a similar manner. Passage times are identified through the concept of events that correspond to the firing of transitions placed at the boundaries of a subnet. The extended model obtained with this specifications is translated into an ordinary GSPN by isolating a customer from the group and highlighting its path through the net thus obtaining a representation suited for the passage time analysis. Proofs are provided to show the equivalence between these models with respect to their steady state distributions. An important and original aspect treated in this paper is the possibility of specifying several scheduling policies of tokens at places, an information not present in ordinary GSPN models, but that is vital for the precise computation of first passage time distributions as shown by a few results computed for a simple Flexible Manufacturing application.

show abstract

First Passage Time Computation in Tagged GSPNs with Queue Places

Balbo¹,

Beccuti²,

Pierro³

et al. 2010

The Computer Journal

View full text Add to dashboard Cite

show abstract

An automated technique to support the verification and validation of simulation models

Klock

Kemper

2010

2010 IEEE/IFIP International Conference on Dependable Systems &Amp; Networks (DSN)

View full text Add to dashboard Cite

Simulation modeling requires model validation and ver ification to ensure that computed results are worth being considered. While we cannot expect a magic solution to the general problem, automated techniques for particular aspects of validation and verification are feasible. In this paper, we propose a technique to deduce model properties automatically from simulation runs performed for verifica tion and validation and to use those properties for runtime monitoring during production runs. Properties are repre sented as formulas in linear temporal logic and are limited to functional properties. We demonstrate the applicability of the approach with using an extended version of a stochas tic Botnet model originally developed by Van Ruitenbeek and Sanders.

show abstract

Computing first passage time distributions in stochastic well-formed nets

Balbo

Beccuti

Pierro

et al. 2011

Proceedings of the 2nd ACM/SPEC International Conference on Performance Engineering

View full text Add to dashboard Cite

The increasing demand for customer centric evaluation of systems, mostly related with the assessment of the quality of service that they can deliver, requires the development of techniques properly designed to model and to study the movement of specific entities generically referred to as "customers". Stochastic Well-Formed Net (SWN) are naturally suited for the representation of systems in which "customers" of different categories compete for the use of common resources. Color classes of SWN are easily associated with these different categories, leaving to the peculiar features of the formalism the possibility of exploiting all the symmetries existing into the representation for the efficient and effective computation of the measures of interest. Within this application context, the computation of first passage time distribution measures in SWN is becoming of primary interest. Customers however are not primitive entities in the formalism and an approach similar to that previously developed for Generalized Stochastic Petri Nets (GSPN) is suggested to overcome this problem in which P-semiflows are used to identify the customers. In this paper we propose an original algorithm for computing some P-semiflows of colored PNs in parametric form by exploiting the peculiarities of the objective of this investigation, and extend the customer centric first passage time computation approach previously developed for GSPNs, to make it suitable for SWN models. Moreover, the paper proposes an enhancement of the SWN notation in order to provide a way to ease the modeler in the specification of customer scheduling policies that may affect the computation of first passage time distributions. This extension, inspired by Queueing Petri Nets, adds to SWN some "syntactic sugar" that allows to include in the model queueing places which are automatically replaced by appropriate submodels, before solving the model.

show abstract

A tool support for automatic analysis based on the tagged customer approach

Cited by 3 publications

References 18 publications

First Passage Time Computation in Tagged GSPNs with Queue Places

First Passage Time Computation in Tagged GSPNs with Queue Places

An automated technique to support the verification and validation of simulation models

Computing first passage time distributions in stochastic well-formed nets

Contact Info

Product

Resources

About