Advertisement

Process Models for Discrete Event Systems

  • Pravin Varaiya
Part of the Progress in Systems and Control Theory book series (PSCT, volume 3)

Abstract

Discrete event systems have inputs and outputs that take on logical or symbolic values, and states that change due to events which are also described symbolically. Such descriptions occur in several situations, including communication networks, manufacturing, and computer-based control. Formally, their behavior is given in terms of sequences of events that unfold in logical time. Mathematical models of such behavior are finite descriptions of these sequences. We review one approach to the construction of such models.

Keywords

Finite State Machine Discrete Event System Communication Sequential Process Recursive Process Process Space 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. Anderson, “Automated Protocol Implementation with RTAG,” IEEE Transactions on Software Engineering, SE-14(3):291–300, March 1988.CrossRefGoogle Scholar
  2. [2]
    S. Aggarwal, D. Barbara and K.Z. Meth, “A software environment for the specification and analysis of problems of coordination and concurrency,” IEEE Softw. Engg., SE-14(3):280–290, March 1988.CrossRefGoogle Scholar
  3. [3]
    Y.C. Ho (ed), Proceedings of the IEEE, January 1989, Special issue on discrete event dynamical systems.Google Scholar
  4. [4]
    C.A.R. Hoare, Communicating sequential processes, Prentice-Hall International, U.K. Ltd., 1985.Google Scholar
  5. [5]
    K. Inan, “Asynchronous dynamical systems, Parts 1, 2,” ERL Memos, Univ. of California, Berkeley, May–June 1989.Google Scholar
  6. [6]
    K. Inan and P. Varaiya, “Finitely recursive process models for discrete event systems,” IEEE Transactions on Automatic Control, vol AC-33(7), pp. 626–639, July 1988.CrossRefGoogle Scholar
  7. [7]
    A.B. Kurzhanski and P. Varaiya (eds), Discrete event systems: Models and applications, Lecture Notes in Control and Information Sciences, Vol 106, Springer, 1988.Google Scholar
  8. [8]
    Z. Manna and P. Wolper, “Synthesis of communicating processes from temporal logic specifications,” ACM Trans. Progr. Lang. Syst., Jan. 1984, 68–93.Google Scholar
  9. [9]
    R. Milner, Calculus of communicating systems, Springer, 1980.Google Scholar
  10. [10]
    T. Murata, “Petri Nets: Properties, analysis and applications,” Proceedings of the IEEE, vol 77(4), pp. 541–580, April 1989.CrossRefGoogle Scholar
  11. [11]
    P.J. Ramadge and W.M. Wonham, “On the supremal controllable sublanguage of a given language,” SIAM J. Contr. Optim., Vol 25(3), May 1987.Google Scholar

Copyright information

© Birkhäuser Boston 1990

Authors and Affiliations

  • Pravin Varaiya

There are no affiliations available

Personalised recommendations