Results 1  10
of
28
Synchronization and linearity: an algebra for discrete event systems
, 2001
"... The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific ..."
Abstract

Cited by 323 (10 self)
 Add to MetaCart
The first edition of this book was published in 1992 by Wiley (ISBN 0 471 93609 X). Since this book is now out of print, and to answer the request of several colleagues, the authors have decided to make it available freely on the Web, while retaining the copyright, for the benefit of the scientific community. Copyright Statement This electronic document is in PDF format. One needs Acrobat Reader (available freely for most platforms from the Adobe web site) to benefit from the full interactive machinery: using the package hyperref by Sebastian Rahtz, the table of contents and all LATEX crossreferences are automatically converted into clickable hyperlinks, bookmarks are generated automatically, etc.. So, do not hesitate to click on references to equation or section numbers, on items of thetableofcontents and of the index, etc.. One may freely use and print this document for one’s own purpose or even distribute it freely, but not commercially, provided it is distributed in its entirety and without modifications, including this preface and copyright statement. Any use of thecontents should be acknowledged according to the standard scientific practice. The
Recent Developments in NonMarkovian Stochastic Petri Nets
, 1998
"... Analytical modeling plays a crucial role in the analysis and design of computer systems. Stochastic Petri Nets represent a powerful paradigm, widely used for such modeling in the context of dependability, performance and performability. Many structural and stochastic extensions have been proposed in ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
Analytical modeling plays a crucial role in the analysis and design of computer systems. Stochastic Petri Nets represent a powerful paradigm, widely used for such modeling in the context of dependability, performance and performability. Many structural and stochastic extensions have been proposed in recent years to increase their modeling power, or their capability to handle large systems. This paper reviews recent developments by providing the theoretical background and the possible areas of application. Markovian Petri nets are first considered together with very well established extensions known as Generalized Stochastic Petri nets and Stochastic Reward Nets. Key ideas for coping with large state spaces are then discussed. The challenging area of nonMarkovian Petri nets is considered, and the related analysis techniques are surveyed together with the detailed elaboration of an example. Finally new models based on Continuous or Fluid Stochastic Petri Nets are briefly discussed.
Approximate Throughput Computation of Stochastic Marked Graphs
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 1994
"... 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 inputsingle output cut, allowing the split of the model through any cut. The approach has ..."
Abstract

Cited by 20 (14 self)
 Add to MetaCart
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 inputsingle output cut, allowing the split of the model through any cut. The approach has two basic foundations. First, a deep understanding of the qualitative behaviour of marked graphs leads to a general decomposition technique. Second, after the decomposition phase, an iterative response time approximation method is applied for the computation of the throughput. Experimental results on several examples generally have an error of less than 3 %. The state space is usually reduced by more than one order of magnitude; therefore the analysis of otherwise intractable systems is possible.
On the Performance of Synchronized Programs in Distributed Networks with Random Processing Times and Transmission Delays
, 1994
"... A synchronizer is a compiler that transforms a program designed to run in a synchronous network into a program that runs in an asynchronous network. The behavior of a simple synchronizer, which also represents a basic mechanism for distributed computing and for the analysis of marked graphs, was stu ..."
Abstract

Cited by 15 (2 self)
 Add to MetaCart
(Show Context)
A synchronizer is a compiler that transforms a program designed to run in a synchronous network into a program that runs in an asynchronous network. The behavior of a simple synchronizer, which also represents a basic mechanism for distributed computing and for the analysis of marked graphs, was studied in [ER1] and [ER2] under the assumption that message transmission delays and processing times are constant. In this paper we study the behavior of the simple synchronizer when processing times and transmission delays are random. Our main performance measure is the rate of a network, i.e., the average number of computational steps executed by a processor in the network, per unit time. We analyze the effect of the topology and the probability distributions of the random variables on the behavior of the network. For random variables with exponential distribution we provide tight (i.e. attainable) bounds and study the effect of a bottleneck processor on the rate. Keywords: Distributed Netwo...
Performance Analysis of Stochastic Timed Petri Nets using Linear Programming Approach
 IEEE Transactions on Software Engineering
, 1995
"... Stochastic timed Petri nets are a useful tool in performance analysis of concurrent systems such as parallel computers, communication networks and flexible manufacturing systems. In general, performance measures of stochastic timed Petri nets are difficult to obtain for problems of practical sizes. ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
(Show Context)
Stochastic timed Petri nets are a useful tool in performance analysis of concurrent systems such as parallel computers, communication networks and flexible manufacturing systems. In general, performance measures of stochastic timed Petri nets are difficult to obtain for problems of practical sizes. In this paper, we provide a method to compute efficiently upper and lower bounds for the throughputs and mean token numbers in general Markovian timed Petri nets. Our approach is based on uniformization technique and linear programming.
Fixed Point Methods for the Simulation of the Sharing of a Local Loop by a Large Number of Interacting TCP Connections
, 2001
"... We study the interaction of a large number of connections over the Internet, sharing the same local loop and controlled by TCP. We focus on the case when the connections are homogeneous and the access router has a FairQueueing scheduling discipline, whereas the Internet is represented by a set of F ..."
Abstract

Cited by 12 (1 self)
 Add to MetaCart
We study the interaction of a large number of connections over the Internet, sharing the same local loop and controlled by TCP. We focus on the case when the connections are homogeneous and the access router has a FairQueueing scheduling discipline, whereas the Internet is represented by a set of FirstInFirstOut (FIFO) routers. We use both simulation and analytical results to determine the characteristics of the throughput obtained by each connection under a realistic description of the traffic offered to the network. The key idea for the analysis consists in a fixed point method which is based on the exact description of one TCP connection and a simplified description of the interaction with the other connections. The convergence of this fixed point method is substantiated by extensive simulations. The validation of the approach is carried out using NS simulation in cases where both methods can be used. We show that the goodput obtained by each connection and its fluctuations can be accurately evaluated from this approach.
Modeling, Analysis and Simulation of Failures in a Materials Handling System with Extended Petri Nets
 IEEE Transactions on Systems, Man and Cybernetics
, 1994
"... This paper models, analyzes, accommodates and simulates potential failures which may occur in a materials handling system with Extended Petri nets (EPNs). EPNs are shown to be able to cope with various important failure situations that occur in a manufacturing system through the definition of six di ..."
Abstract

Cited by 10 (8 self)
 Add to MetaCart
This paper models, analyzes, accommodates and simulates potential failures which may occur in a materials handling system with Extended Petri nets (EPNs). EPNs are shown to be able to cope with various important failure situations that occur in a manufacturing system through the definition of six different types of places. Detailed EPN based subnets are provided to study and accommodate occurred failures. The approach described proposes an efficient methodology to generate an overall EPN design to model and analyze potential system failures at different levels of detail. It has been observed that the study of boundedness properties rather than the safeness properties of a manufacturing system with resource constraints leads to a better defined EPN system model. The subnet structural properties and the overall system properties are preserved. The Stochastic Petri Net Package (SPNP) is used for simulation studies. I. Introduction Flexibility, autonomy and reliability are important syste...
Properties of Fork/Join Queueing Networks with Blocking under Various Operating Mechanisms
, 1992
"... Queueing networks with fork/join mechanisms and finitecapacity buffers are of interest because they are suited to modeling and evaluating the performance of a large class of discrete event systems such as manufacturing systems (e.g., manufacturing flow lines, assembly lines, kanban controlled manuf ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
Queueing networks with fork/join mechanisms and finitecapacity buffers are of interest because they are suited to modeling and evaluating the performance of a large class of discrete event systems such as manufacturing systems (e.g., manufacturing flow lines, assembly lines, kanban controlled manufacturing systems). In a recent paper, Dallery, Liu and Towsley [14] considered a special class of queueing networks with fork/join mechanisms and finitecapacity buffers called Basic Fork/Join Queueing Networks with Blocking (BFJQN/B). For this class of networks, they established duality, reversibility, symmetry and concavity properties. However, in order to be able to accurately model the various operating mechanisms (blocking, loading and unloading mechanisms) encountered in manufacturing systems, it is necessary to consider a larger class of networks that will be referred to as Fork/Join Queueing Networks with Blocking (FJQN/B). The purpose of this paper is to introduce this class of queu...
A Survey on Solution Methods for Task Graph Models
, 1993
"... We give in this paper a survey on models developed in the literature using the concept of task graphs, focusing on solution techniques. Different types of task graphs are considered, from PERTS networks to random task graphs. Reviewed solution methods include exact computations and bounds. 1 Int ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
We give in this paper a survey on models developed in the literature using the concept of task graphs, focusing on solution techniques. Different types of task graphs are considered, from PERTS networks to random task graphs. Reviewed solution methods include exact computations and bounds. 1 Introduction, Concepts and Notations The purpose of this paper is to survey models based on stochastic task graph representations and the solutions techniques that have been developed for them. The reason for doing this in the framework of the QMIPS project is that task graphs appear to be of central importance in the modeling and analysis of parallel programs and architectures. Yet, the solution of task graph problems is difficult in general. No really satisfactory and sufficiently general solutions have been proposed as of today, and research is still active in the area. The term "task graphs" covers now a wide variety of models. We shall begin the survey with what appears to be the initi...
Equivalence, Reversibility, Symmetry and Concavity Properties in ForkJoin Queueing Networks with Blocking
, 1993
"... In this paper we study quantitative as well as qualitative properties of ForkJoin Queueing Networks with Blocking (FJQN/B's). Specifically, we prove results regarding the equivalence of the behavior of a FJQN/B and that of its duals and a strongly connected marked graph. In addition, we obt ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
In this paper we study quantitative as well as qualitative properties of ForkJoin Queueing Networks with Blocking (FJQN/B's). Specifically, we prove results regarding the equivalence of the behavior of a FJQN/B and that of its duals and a strongly connected marked graph. In addition, we obtain general conditions that must be satisfied by the service times to guarantee the existence of a long term throughput and its independence on the initial configuration. We also establish conditions under which the reverse of a FJQN/B has the same throughput as the original network. By combining the equivalence result for duals and the reversibility result, we establish a symmetry property for the throughput of a FJQN/B. Last, we establish that the throughput is a concave function of the buffer sizes and the initial marking, provided that the service times are mutually independent random variables belonging to the class of PERT distributions that includes the Erlang distributions. This la...