By Topic

Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)

8-10 Sept. 1999

Filter Results

Displaying Results 1 - 24 of 24
  • Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331)

    Publication Year: 1999
    Request permission for commercial reuse | PDF file iconPDF (166 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 1999, Page(s): 228
    Request permission for commercial reuse | PDF file iconPDF (4 KB)
    Freely Available from IEEE
  • Performance evaluation of IEEE 802.11 wireless LANs with stochastic Petri nets

    Publication Year: 1999, Page(s):44 - 53
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    IEEE has recently standardized the physical layer and the medium access mechanism for wireless local area networks. This paper presents a performance study of the distributed coordination function, the fundamental contention based access mechanism. Stochastic Petri nets are used as a modeling formalism. A detailed model captures all relevant system aspects in a concise way. The detailed model is e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On state space decomposition for the numerical analysis of stochastic Petri nets

    Publication Year: 1999, Page(s):32 - 41
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    Net-driven decomposition techniques are considered in this paper in order to reduce the state explosion problem for the computation of performance indices of stochastic Petri nets. Basically, the idea is to represent (or partially represent) in a decomposed manner the reachability graph of the model so it can be used for exact and/or approximated performance analysis. In that way, the complete sto... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A data structure for the efficient Kronecker solution of GSPNs

    Publication Year: 1999, Page(s):22 - 31
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB)

    Kronecker-based approaches have been proposed for the solution of structured GSPNs with extremely large state spaces. Representing the transition rate matrix using Kronecker sums and products of smaller matrices virtually eliminates its storage requirements, but introduces various sources of overhead. We show how, by using a new data structure which we call matrix diagrams, we are able to greatly ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the efficient sequential and distributed generation of very large Markov chains from stochastic Petri nets

    Publication Year: 1999, Page(s):12 - 21
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    In this paper we present efficient techniques for the generation of very large continuous-time Markov chains (CTMCs) specified as stochastic Petri nets (SPNs). In particular, we investigate how the storage efficiency of the reachability graph generation can be improved by using good state coding techniques and by using hashing tables instead of tree-based data structures. These techniques allow us... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On non-decidability of reachability for timed-arc Petri nets

    Publication Year: 1999, Page(s):188 - 196
    Cited by:  Papers (7)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    Timed-arc Petri nets are not Turing powerful, because, in particular, they cannot simulate a counter with test on zero. Thus, we could think that this model does not extend significantly the expressiveness of untimed Petri nets. But this is not true; in this paper we show that the differences between them are big enough to make the reachability problem undecidable. We also define dead tokens as th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated frameworks for multi-level and multi-formalism modeling

    Publication Year: 1999, Page(s):2 - 9
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (80 KB)

    There have been significant advances in methods for specifying and solving models that aim to predict the performance and dependability of computer systems and networks. At the same time, however, there have been dramatic increases in the complexity of the systems whose performance and dependability must be evaluated, and considerable increases in the expectations of analysts that use performance/... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the rational use of Petri nets, automata and the max algebra for the optimal control of DEDS

    Publication Year: 1999, Page(s):179 - 186
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB)

    We show here how the discrete Petri nets, languages and automata, and max-algebra approaches to DEDS yield complementary results. Using a simple discrete event dynamic system, we show how this complementarity may be used for the optimal control of a DEDS: the conditions ensuring liveness of the Petri net model yield admissible control strategies; the automaton of the system then exhibits nondeterm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploiting Petri nets to support fault tree based dependability analysis

    Publication Year: 1999, Page(s):146 - 155
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (204 KB)

    This paper explores the possibility of converting Fault Trees (FT) into the Generalized Stochastic Petri Net (GSPN) formalism. Starting from a slightly modified version of a conversion algorithm already appeared in the literature, the aim of the paper is to exploit the modeling and decision power of GSPN for both the qualitative and the quantitative analysis of the modeled system. The qualitative ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal relation of Markov renewal theory and supplementary variables in the analysis of stochastic Petri nets

    Publication Year: 1999, Page(s):64 - 73
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB)

    Non-Markovian stochastic Petri nets have been investigated mainly by means of Markov renewal theory and by the method of supplementary variables. Both approaches provide different analytic descriptions of the same system. Numerical algorithms based on these descriptions lead to similar results. Parallel research effort resulted from the fact that an exact relationship of the two was not known. In ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Scenario durations characterization of t-timed Petri nets using linear logic

    Publication Year: 1999, Page(s):208 - 217
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (132 KB)

    This paper aims to handle scenario durations of t-timed Petri nets without constructing the class graph. We use a linear logic characterization of scenarios based on the equivalence between reachability in Petri nets and provability of a class of linear logic sequents. It has been shown that it was possible to characterize a scenario with concurrency induced both by the Petri net structure and by ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimal control of (min,+) linear time-varying systems

    Publication Year: 1999, Page(s):170 - 178
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    The class of discrete event dynamic systems involving only synchronization phenomena can be seen as linear time-invariant systems in a particular algebraic structure called (min,+) algebra. In the same framework, this paper deals with linear time-varying systems, that is, systems whose parameters may change as functions of time. For example, in a manufacturing system the number of working machines... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A mapping of autonomous net condition event systems to GSPNs

    Publication Year: 1999, Page(s):136 - 145
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB)

    The software design for automatic controller in manufacturing systems shows lower complexity than for other applications but has high requirements for correctness, robustness and performance. Net condition event systems (NCES) are a net-based modelling formalism recently developed for this task. In this paper we give an interpretation of autonomous NCES in terms of generalized stochastic Petri net... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling software systems with rejuvenation, restoration and checkpointing through fluid stochastic Petri nets

    Publication Year: 1999, Page(s):82 - 91
    Cited by:  Papers (15)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    In this paper, we present a Fluid Stochastic Petri Net (FSPN) based model which captures the behavior of aging software systems with checkpointing, rejuvenation and self-restoration, three well known techniques of software fault tolerance. The proposed FSPN based modeling framework is novel in many aspects. First, the FSPN formalism itself is extended by adding flush-out arcs. Second, the three te... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Clarifying the priority specification of GSPN: Detached priorities

    Publication Year: 1999, Page(s):114 - 123
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (284 KB)

    The global multilevel priority definition in GSPN, while being most convenient with many respects, poses some modelling problems related with confusion and indirect conflicts, which may lead to undesired effects in the definition of the underlying stochastic process. While some of these problems have been recognized and dealt with in previous works on the definition of GSPN, through the introducti... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Non equivalence between time Petri nets and time stream Petri nets

    Publication Year: 1999, Page(s):198 - 207
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB)

    It had been shown that Merlin's Time Petri Nets are a special case of Time Stream Petri Nets. In this paper, we show that there does not exist a time equivalence between both models. We extend first this result to the non equivalence of Timed Automata and Time Petri Nets and second to the non equivalence of Timed Link Petri Net and Timed Transition Petri Net View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asymptotic analysis of heaps of pieces and application to timed Petri nets

    Publication Year: 1999, Page(s):158 - 169
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (588 KB)

    What is the density of an infinite heap of pieces, if we let pieces fall down randomly, or if we select pieces to maximize the density? How many transitions of a safe timed Petri net can we fire per time unit? We reduce these questions to the computation of the average and optimal case Lyapunov exponents of max-plus automata, and we present several techniques to compute these exponents. First, we ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Checking time Petri nets for linear duration properties

    Publication Year: 1999, Page(s):218 - 227
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (140 KB)

    In this paper, we consider the problem of checking 1-safe time Petri nets for linear duration properties, which are linear inequalities on integrated durations of system states. By showing that a 1-safe time Petri net satisfies a linear duration property if and only if its integral behaviour satisfies the linear duration property, we can give an algorithm that solves the problem based on investiga... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Stepwise refinements of net models and their place invariants

    Publication Year: 1999, Page(s):92 - 101
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    Schedules for manufacturing cells can be systematically derived by simple stepwise refinements which, in consecutive steps, increase the complexity of the cell by introducing its components one after another. Timed Petri net models of schedules derived in this way have some convenient structural properties-net models are covered by conflict-free subnets, determined by place invariants of the model... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An efficient well-specified check

    Publication Year: 1999, Page(s):124 - 133
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (144 KB)

    A long-standing problem with generalized stochastic Petri nets and extensions is that of what to do when more than one zero-timed event is scheduled to occur at the same time. If the order is left unspecified, it could lead to ambiguity that affects reward variables. Stochastic activity nets (SANs) have used the well-specified condition to avoid this problem. However, the existing algorithm to per... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fluid stochastic Petri nets: An extended formalism to include non-Markovian models

    Publication Year: 1999, Page(s):74 - 81
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB)

    A Fluid Stochastic Petri Net (FSPN) formalism, where there are two kind of places, one which carries discrete tokens and the other which contains continuous quantity, is presented and discussed. In the proposed formulation, a new primitive is introduced, called flush-out arc. A flush-out arc connects a transition to a continuous place and has the effect of instantaneously empty the place when the ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GSPN analysis of dual-band mobile telephony networks

    Publication Year: 1999, Page(s):54 - 63
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (268 KB)

    In this paper we present detailed and compact GSPN models for the performance analysis, design, and planning of cellular mobile telephony networks in which the utilization of two separate frequency bands for the provision of services to end users (like in dual-band GSM systems) complicates the cellular structure with the presence of microcells and macrocells. The flexibility of the GSPN modeling a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implicit places in net systems

    Publication Year: 1999, Page(s):104 - 113
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB)

    Implicit places are a powerful tool inside Petri net theory, used in many design phases of a system. Firstly used as a reduction rule of Petri nets, now are widely used in quantitative and qualitative analysis, synthesis of models or in fault-tolerant implementations. This paper reviews the basic definitions and results on these places, clarifying many of the previous proofs. We also present new r... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.