Scheduled System Maintenance
On Saturday, October 21, single article sales and account management will be unavailable until 6 PM ET.
Notice: There is currently an issue with the citation download feature. Learn more.

Proceedings of the IEEE

Issue 1 • Jan 1989

Filter Results

Displaying Results 1 - 15 of 15
  • Sample path properties of timed discrete event systems

    Publication Year: 1989, Page(s):59 - 71
    Cited by:  Papers (33)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1000 KB)

    The basic problem of constructing a perturbed sample path (given a parameter perturbation) from information contained in a nominal sample path is considered. Two conditions, observability and constructability, which have to be satisfied for this to be feasible are identified. One approach for accomplishing this task is to develop an augmented system model which captures both nominal and perturbed ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed routing for load balancing

    Publication Year: 1989, Page(s):210 - 221
    Cited by:  Papers (14)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (968 KB)

    Some open-loop and closed-loop control algorithms are discussed for an example of a discrete-event system, namely, the routing of arriving tasks from different arrival streams among several possible service stations. It is shown that it is possible to design open-loop policies that give good performance in a way which is very robust with respect to large changes in the arrival rates. This is possi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebraic tools for the performance evaluation of discrete event systems

    Publication Year: 1989, Page(s):39 - 85
    Cited by:  Papers (159)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1648 KB)

    It is shown that a certain class of Petri nets called event graphs can be represented as linear time-invariant finite-dimensional systems using some particular algebras. This sets the ground on which a theory of these systems can be developed in a manner which is very analogous to that of conventional linear system theory. Some preliminary basic developments in that direction are shown. Several wa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical flow control: a framework for scheduling and planning discrete events in manufacturing systems

    Publication Year: 1989, Page(s):195 - 209
    Cited by:  Papers (137)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1128 KB)

    The synthesis of operating policies for manufacturing systems is discussed. These are feedback laws that respond to potentially disruptive events. Laws are developed that are based on realistic dynamic programming models that account for the discrete nature of manufacturing and are computationally tractable. These scheduling and planning policies have a hierarchical structure which is systematical... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The control of discrete event systems

    Publication Year: 1989, Page(s):81 - 98
    Cited by:  Papers (1278)  |  Patents (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1540 KB)

    A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Such systems arise in a variety of contexts ranging from computer operating systems to the control of complex multimode processes. A control theory for the logical aspects of such DESs is surveyed. The focus is on the qualitative aspe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Introduction to special issue on dynamics of discrete event systems

    Publication Year: 1989, Page(s):3 - 6
    Cited by:  Papers (57)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (316 KB)

    An overview of discrete-event dynamic system (DEDSs) is given, explaining what they are and discussing their modeling. The types of models are outlined, and factors to be taken into account in modeling are examined. They are: the discontinuous nature of discrete events; the continuous nature of most performance measures; the importance of probabilistic formulation; the need for hierarchical analys... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algebras of discrete event models

    Publication Year: 1989, Page(s):24 - 38
    Cited by:  Papers (23)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1020 KB)

    The authors consider discrete event models (DEMs) that describe logical system behavior, i.e. mathematical models that represent the set of traces of sequences of events that the system can execute. Examples of DEM formalisms include state machines, Petri nets, and Hoare's communicating sequential processes. All these formalisms are algebras, i.e. a set of models together with operators that combi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue

    Publication Year: 1989, Page(s):171 - 194
    Cited by:  Papers (38)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1928 KB)

    Measurements and approximations are proposed to describe the variability of offered traffic to a queue and predict the average workload in the queue. The principal traffic measurement considered is a normalized version of the variance of the total input of work as a function of time, which is called the index of dispersion for work (IDW). Given ample traffic data, the IDW can easily be estimated u... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • DEVS representation of dynamical systems: event-based intelligent control

    Publication Year: 1989, Page(s):72 - 80
    Cited by:  Papers (71)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (752 KB)

    It is shown how systems can be advantageously represented as discrete event models by using DEVS (discrete event system specification), set-theoretic formalism. Such DEVS models provide a basis for the design of event-based logic control. In this control paradigm, the controller expects to receive confirming sensor responses to its control commands within definite time windows determined by its DE... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed simulation of discrete event systems

    Publication Year: 1989, Page(s):99 - 113
    Cited by:  Papers (47)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1520 KB)

    An overview of distributed simulation of discrete event systems and the issues associated with it. Alternative approaches for decomposing the simulation into tasks that can be run on separate processors are described, and the potential parallelism associated with certain kinds of decomposition is studied. Existing synchronization algorithms are discussed. An attempt is made throughout to show what... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A comparison of the dynamics of continuous and discrete event systems

    Publication Year: 1989, Page(s):7 - 13
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (504 KB)

    The results of perturbation analysis pertaining to closed queuing networks are reviewed, showing that the basic principles of perturbation analysis can be explained using a dynamic point of view. It is shown that perturbation generation and perturbation propagation rules can be viewed as counterparts of the linearization theory of nonlinear continuous variable dynamic systems; the concept of pertu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Perturbation analysis: the state of the art and research issues explained via the GI/G/1 queue

    Publication Year: 1989, Page(s):114 - 137
    Cited by:  Papers (111)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2152 KB)

    Perturbation analysis (PA) of discrete event dynamic systems (DEDS) enables parameter sensitivities of DEDS to be obtained by observing a single sample path of the system. A simple GI/G/1 system is used to give an introduction to PA and illustrate the basic theoretical issues involved in this technique. The application of PA to networks of queues is covered briefly, and then some of the recent ext... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A GSMP formalism for discrete event systems

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

    A precise mathematical framework for the study of discrete event systems is described. The idea is to define a particular type of stochastic process, called a generalized semi-Markov process (GSMP), which captures the essential dynamical structure of a discrete event system. An attempt is also made to give the flavor of the qualitative theory and numerical algorithms that can be obtained as a resu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Queueing models for systems with synchronization constraints

    Publication Year: 1989, Page(s):138 - 161
    Cited by:  Papers (65)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1964 KB)

    The authors consider queueing that occur naturally in the study of a class of resource-sharing problems under synchronization constraints such as resequencing and fork-join primitives. These queueing models are amenable to a representation in terms of a state recursion. The proposed methods of analysis are complementary and draw on classical ideas of queuing theory as well as on mathematical tools... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Second-order stochastic properties in queueing systems

    Publication Year: 1989, Page(s):162 - 170
    Cited by:  Papers (28)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (780 KB)

    The authors have developed and applied probabilistic tools to establish second-order stochastic properties such as convexity and concavity in the optimal design and control of queueing systems. Their approaches are based on constructing and comparing the dynamical sample paths of the stochastic processes under study. They present a tutorial on these notions and results in stochastic convexity/conc... View full abstract»

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

Aims & Scope

The most highly-cited general interest journal in electrical engineering and computer science, the Proceedings is the best way to stay informed on an exemplary range of topics.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
H. Joel Trussell
North Carolina State University