1 / 16

EECE 396-1 Hybrid and Embedded Systems: Computation

EECE 396-1 Hybrid and Embedded Systems: Computation. T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and Computer Science Vanderbilt University 300 Featheringill Hall January 22, 2004 john.koo@vanderbilt.edu

helaine
Download Presentation

EECE 396-1 Hybrid and Embedded Systems: Computation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. EECE 396-1Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and Computer Science Vanderbilt University 300 Featheringill Hall January 22, 2004 john.koo@vanderbilt.edu http://www.vuse.vanderbilt.edu/~kootj

  2. Hybrid System • A system built from atomic discrete components and continuous components by parallel and serial composition, arbitrarily nested. • The behaviors and interactions of components are governed by models of computation (MOCs). • Discrete Components • Finite State Machine (FSM) • Discrete Event (DE) • Synchronous Data Flow (SDF) • Continuous Components • Ordinary Differential Equation (ODE) • Partial Differential Equation (PDE)

  3. Modeling: Finite State Machine

  4. Topics • Relations • Binary Relation • Relation Properties • Equivalent Relation • Alphabets • Strings • Language • Finite Automata • Deterministic Finite Automata • Non- Deterministic Finite Automata • Ref: • D. L. Johnson, Elements of Logic via Numbers and Sets, Springer, 1998. • Harry R. Lewis and Christos H. Papadimitrious, Elements of The Theory of Computation, Prentice Hall, 1998.

  5. Relations

  6. Relations

  7. Relations

  8. Relations

  9. Alphabets

  10. Deterministic Finite Automata

  11. Deterministic Finite Automata

  12. Deterministic Finite Automata

  13. Non-Deterministic Finite Automata

  14. Non-Deterministic Finite Automata

  15. Non-Deterministic Finite Automata

  16. End

More Related