Languages and Automata
We have seen how discrete-event systems (DES) differ from continuous-variable dynamic systems (CVDS) and why DES are not adequately modeled through differential or difference equations. Our first task, therefore, in studying DES is to develop appropriate models, which both adequately describe the behavior of these systems and provide a framework for analytical techniques to meet the goals of design, control, and performance evaluation.
KeywordsRegular Expression Regular Language Parallel Composition Marked State Unobservable Event
Unable to display preview. Download preview PDF.
Languages and Automata Theory
- Hoperoft, J.E., and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979.Google Scholar
Automata and Related Modeling Formalisms
Some Other (Untimed) Modeling Formalisms for Discrete Event Systems
- Baeten, J.C.M., and W.P. Weijland, Process Algebra, Volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Great Britain, 1990.Google Scholar
- Corner, T.H., C. Leiserson, and R.L. Rivest, Introduction to Algorithms, MIT Press and McGraw-Hill, New York, 1990.Google Scholar
- Dini, P., R. Boutaba, and L. Logrippo (Eds.), Feature Interactions in Telecommunication Networks IV, IOS Press, Amsterdam, The Netherlands, 1997.Google Scholar
- Holzmann, G.J., Design and Validation of Computer Protocols, Prentice-Hall, Englewood Cliffs, NJ, 1991.Google Scholar