Skip to main content

Abstract

In practice, systems always operate in environments which are constantly plagued by uncertainty. This is especially true in dealing with DES, which, by their nature, often involve unpredictable human actions and machine failures. The process of resource sharing (which provides an important motivation for studying DES) is inherently characterized by such unpredictability: changing user demand, computer breakdowns, inconsistencies in human decision making, etc. While the untimed (or logical) models considered in Chapters 2 to 4 do account for “all possible behaviors” of the system, their use is limited to logical (or qualitative) performance objectives. Deterministic timed models of the type considered in Chapter 5 certainly contribute to our basic understanding of some quantitative properties of the dynamic behavior of a system (for instance, the periodic behavior of systems that can be modeled as marked graphs). But their use is limited since models with deterministic clock structures only capture a single timed string of events (or states), or, in other words, a single sample path of the system. If we are to develop either descriptive or prescriptive techniques for evaluating performance and for “optimally” controlling timed DES with respect to quantitative performance measures and in the presence of uncertainty, more refined models that incorporate stochastic elements are required.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Selected References

Review of Probability and Stochastic Processes

  • Clarke, A. B., and R.L. Disney, Probability and Random Processes, Wiley, New York, 1985.

    MATH  Google Scholar 

  • Gallager, R.G., Discrete Stochastic Processes, Kluwer Academic Pub-lishers, Boston, 1996.

    Book  Google Scholar 

  • Hoel, P.G., S.C. Port, and C.J. Stone, Introduction to Stochastic Processes, Houghton Mifflin, Boston, 1972.

    MATH  Google Scholar 

  • Parzen, E., Stochastic Processes, Holden-Day, San Francisco, 1962.

    MATH  Google Scholar 

Queueing Models

  • Kleinrock, L., Queueing Systems, Volume I: Theory, Wiley, New York, 1975.

    MATH  Google Scholar 

  • Walrand, J., An Introduction to Queueing Networks, Prentice-Hall, Englewood Cliffs, 1988.

    MATH  Google Scholar 

Stochastic Timed Automata

  • Glynn, P., “A GSMP Formalism for Discrete Event Systems,” Proceedings of the IEEE, Vol. 77, No. 1, pp. 14–23, 1989.

    Article  Google Scholar 

  • Ho, Y.C., and X. Cao, Perturbation Analysis of Discrete Event Dynamic Systems, Kluwer Academic Publishers, Boston, 1991.

    Book  MATH  Google Scholar 

  • Glasserman, P., and D.D. Yao, Monotone Structure in Discrete-Event Systems, Wiley, New York, 1994.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer Science+Business Media New York

About this chapter

Cite this chapter

Cassandras, C.G., Lafortune, S. (1999). Stochastic Timed Automata. In: Introduction to Discrete Event Systems. The Kluwer International Series on Discrete Event Dynamic Systems, vol 11. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-4070-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-4070-7_6

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4757-4072-1

  • Online ISBN: 978-1-4757-4070-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics