By Topic

Petri Nets and Performance Models, 1993. Proceedings., 5th International Workshop on

Date 19-22 Oct. 1993

Filter Results

Displaying Results 1 - 25 of 29
  • Proceedings of 5th International Workshop on Petri Nets and Performance Models

    Publication Year: 1993
    Request permission for commercial reuse | PDF file iconPDF (22 KB)
    Freely Available from IEEE
  • Sensitivity analysis of Markov regenerative stochastic Petri nets

    Publication Year: 1993, Page(s):180 - 181
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (700 KB)

    Sensitivity analysis, i.e., the analysis of the effect of small variations in system parameters on the output measures, can be studied by computing the derivatives of the output measures with respect to the parameter. An algorithm for parametric sensitivity analysis of Markov regenerative stochastic Petri nets (MRSPN) is presented. MRSPNs are a true generalization of stochastic Petri nets, in that... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On the structural and behavioural characterization of P/T nets

    Publication Year: 1993, Page(s):66 - 75
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (684 KB)

    Deadlocks and traps are well-known net structures that may be identified to characterize the behavior of nets. These structures have been defined on ordinary nets (with arc multiplicity 1). Although they can be computed on generalized nets (with arc multiplicity ⩾ 1), their relation with behavioral properties becomes less clear in this case. Similar problems may be found in the definition of c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of deterministic and stochastic Petri nets

    Publication Year: 1993, Page(s):160 - 169
    Cited by:  Papers (22)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    A time and space efficient algorithm for computing steady state solutions of deterministic and stochastic Petri nets (DSPNs) with both stochastic and structural extensions is presented. The algorithm can deal with different execution policies associated with deterministic transitions of a DSPN. The definition of a subordinated Markov chain (SMC) is refined to reduce the computational cost of deriv... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fast simulation of rare events in stochastic Petri nets

    Publication Year: 1993, Page(s):238 - 247
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (748 KB)

    It is shown how variance reduction techniques can be used simulating rare events in stochastic Petri nets. The application of fast simulation methods is illustrated for several classes of stochastic Petri nets: GSPNs, deterministic and stochastic Petri nets, and Petri nets with generally distributed firing times are studied. For the latter case, different state change policies such as resampling a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A methodology for formal expression of hierarchy in model solution

    Publication Year: 1993, Page(s):258 - 267
    Cited by:  Papers (9)  |  Patents (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    A methodology for formal specification of hierarchy both in model specification and model solution is presented. Hierarchy is allowed to exist among different model types used in performance and dependability modeling. This offers a lot of flexibility and power to the modeler. The methodology presents a unified view of a variety of modeling techniques such as hierarchical composition, behavioral d... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Quantitative evaluation of discrete event systems: Models, performances and techniques

    Publication Year: 1993, Page(s):2 - 11
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (704 KB)

    Assuming that with the increasing complexity of new architectures, modeling and performance evaluation of discrete event systems are more and more necessary, the authors present some general remarks on the modeling concept. Queuing networks, whose theory has been stimulated by needs in the computing field, are presented, together with the main ideas of their general solution. A more recent formali... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Validation and performance analysis of network algorithms by coloured Petri nets

    Publication Year: 1993, Page(s):280 - 289
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (856 KB)

    Different usage parameter control (UPC) algorithms for high-speed asynchronous transfer mode (ATM) networks are studied. The purpose of the UPC algorithms is to prevent congestion in the network by monitoring input traffic and marking the excess traffic. Four UPC algorithms are modeled by means of hierarchical colored Petri nets with time. The purpose of the model is validation and performance ana... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Definition of the model-"Stochastic timed well formed coloured nets"

    Publication Year: 1993, Page(s):24 - 33
    Cited by:  Papers (1)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (708 KB)

    A model able to deal with the main characteristics of the real-time distributed systems (complex systems with a big number of components; systems with a lot of different time characteristics and, in particular, time constraints) is defined. The stochastic timed well-formed colored nets (STWN model) are based on two underlying models: the well-formed colored nets (WN) which provide both a concise a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The implications of industrial systems' complexity on methodologies for system design and evaluation

    Publication Year: 1993, Page(s):192 - 201
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (524 KB)

    Industrial systems become more and more complex and a lot of implications can be identified which generally influence system design and development. These implications are discussed based on experiences in system modeling and demonstrated by industrial applications. This results in the concept of a methodology which is described by different aspects of system modeling and by the features of the mo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conflict sets in colored Petri nets

    Publication Year: 1993, Page(s):76 - 85
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (692 KB)

    Generalized stochastic Petri nets provide the modeller with immediate transitions, but a model will be correct only if the modeller can specify how to solve the firing conflicts between these transitions. This task is usually cumbersome and may be impossible for large nets. In confusion-free nets, these conflict sets are subsets of equivalence classes of a structural conflict relation, which great... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A characterization of independence for competing Markov chains with applications to stochastic Petri nets

    Publication Year: 1993, Page(s):117 - 126
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    It is shown that recently obtained product form results for stochastic Petri nets can immediately be obtained as a special case of a simple exclusion mechanism for the product process of a collection of Markov chains. The model is described, and several examples of exclusion/competition mechanisms that can be modeled in the framework of this paper are given View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A characterization of the stochastic process underlying a stochastic Petri net

    Publication Year: 1993, Page(s):170 - 179
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (712 KB)

    Stochastic Petri nets (SPNs) with generally distributed firing times are isomorphic to generalized semi-Markov processes (GSMPs), but simulation is the only feasible approach for their solution. The authors explore a hierarchy of SPN classes where modeling power is reduced in exchange for an increasingly efficient solution. Generalized stochastic Petri nets (GSPNs), deterministic and stochastic Pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decidability of the strict reachability problem for TPN's with rational and real durations

    Publication Year: 1993, Page(s):56 - 65
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (824 KB)

    Timed Petri nets with rational and real durations are introduced. A timed version of the reachability problem, the strict reachability problem, which imposes a time limit to reach the given marking, is presented. It is shown that both in the case of rational durations, and in that of real durations, this strict reachability problem is decidable. In the first case, the result is obtained by scaling... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computing bounds for the performance indices of quasi-lumpable stochastic well-formed nets

    Publication Year: 1993, Page(s):148 - 157
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (840 KB)

    The stochastic well-formed colored Petri net (SWN) formalism and the associated reachability graph (RG). The method for computing bounds of quasi-lumpable Markov chains is summarized. A structural analysis algorithm to check whether a given SWN is quasi-lumpable, and a modified symbolic RG (SRG) generation algorithm for the generation of the aggregate MC used for the bounds computation are describ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel architectures with regular structure: A case study in modelling using stochastic well-formed coloured Petri nets

    Publication Year: 1993, Page(s):226 - 235
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (772 KB)

    It is shown how to study the latency of packets exchanged by MIMD distributed memory architectures with regular structures. To reach this goal, the single node, the architecture topology, the routing algorithm, and the flow control algorithm are modeled. Models have been built with the formalism of stochastic well-formed coloured Petri nets (SWNs) having in mind modularity. Different types of node... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automated time scale decomposition and analysis of stochastic Petri nets

    Publication Year: 1993, Page(s):248 - 257
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (740 KB)

    The automated application of time-scale decomposition to stochastic Petri nets is studied. Time-scale decomposition exploits the tendency of a system to approach a short-term equilibrium between relatively rare events and has been extensively studied in the context of Markov chains and queuing networks. Previous approaches for applying time-scale decomposition to SPN models relied heavily upon hum... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • On scalable net modeling of OLTP

    Publication Year: 1993, Page(s):270 - 279
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB)

    Practical experiments with the net modeling of OLTP (online transaction processing) applications are discussed. The goal was to propose a convenient and flexible model that would be easy to modify with respect to different scheduling algorithms, number of processors, and disks. The parameters of the model may be varied depending on the size of available memory and timing in a model in order to pro... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing Petri Nets-A formalism for the combined qualitative and quantitative analysis of systems

    Publication Year: 1993, Page(s):14 - 23
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB)

    System analysis is often needed with respect to both qualitative and quantitative aspects. In recent decades, several formalisms have been developed that attempt to combine these aspects in one description. Present emphasis is on stochastic Petri nets. One disadvantage of these formalisms is the difficulties when describing scheduling strategies with Petri net elements. A new version of queuing Pe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithms for product-form stochastic Petri nets-A new approach

    Publication Year: 1993, Page(s):108 - 116
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (392 KB)

    A general relationship between utilizations in product-form stochastic Petri nets (PF-SPNs) is used to derive a method for calculating the normalizing constant. The method collects the contributions of many states together as geometric sums and in general provides a recursive algorithm with numerical complexity independent of the size of the initial marking. The technique is applied to some simple... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards a simplified building of time Petri Nets reachability graph

    Publication Year: 1993, Page(s):46 - 47
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (724 KB)

    An enumerative approach for time Petri nets (or Melin's model) analysis is presented. In this model, if a transition t is enabled at time τ, it can be fired at any time in the interval [τ+tmax(t)]. It is shown that the firing condition at the nth firing can be expressed by the means of the marking, the enabling point of enabled transitions, and the minimal and maximal elapsed time between ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aggregation and reduction techniques for hierarchical GCSPNs

    Publication Year: 1993, Page(s):216 - 225
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (960 KB)

    The classes of stochastic well-formed colored nets (SWNs) and hierarchical generalized colored stochastic Petri nets (HGCSPNs) have been recently introduced for the specification and analysis of complex systems. SWNs allow the specification of models including symmetries in a very compact way and additionally can be used to generate a reduced Markov chain (MC) from the net specification by exploit... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GSPN modelling methods for performance and dependability evaluation of a real-life flexible manufacturing system

    Publication Year: 1993, Page(s):290 - 299
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (564 KB)

    Generalized stochastic Petri nets (GSPNs) are used to model and analyze a real flexible manufacturing system (FMS). First, performance and dependability evaluation are applied to a real-life system. A global system is decomposed to reduce the complexity evaluation. Temporal analysis is used to derive performance measures such as the average production per day. Second, a solution is proposed to inc... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Computational algorithms for product form solution stochastic Petri nets

    Publication Year: 1993, Page(s):98 - 107
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (656 KB)

    It is shown that the steady-state probability distribution of stochastic Petri nets (SPNs) with product form solution can be efficiently computed using an algorithm whose space and time complexities are polynomial in the number of places and in the number of tokens in the initial marking of the SPN. Basic to the derivation of such an algorithm is a product form solution criterion proposed by J. L.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general iterative technique for approximate throughput computation of stochastic marked graphs

    Publication Year: 1993, Page(s):138 - 147
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (972 KB)

    A general iterative technique for approximate throughput computation of stochastic strongly connected marked graphs is presented. It generalizes a previous technique based on net decomposition through a single input-single output cut, allowing the split the model through any cut. The approach has two basic foundations. First, a deep understanding of the qualitative behavior of marked graphs leads ... View full abstract»

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