EECE 396-1 Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.

Slides:



Advertisements
Similar presentations
Hybrid automata - Abstraction Anders P. Ravn Department of Computer Science, Aalborg University, Denmark Hybrid Systems – PhD School Aalborg University.
Advertisements

Language and Automata Theory
CMPS 3223 Theory of Computation
CS 367: Model-Based Reasoning Lecture 2 (01/15/2002)
Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin CS CS 4384 – HON001 Automata Theory
Finite Automata Section 1.1 CSC 4170 Theory of Computation.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
Systems Engineering for Automating V&V of Dependable Systems John S. Baras Institute for Systems Research University of Maryland College Park
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
Languages. A Language is set of finite length strings on the symbol set i.e. a subset of (a b c a c d f g g g) At this point, we don’t care how the language.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
Type System, March 12, Data Types and Behavioral Types Yuhong Xiong Edward A. Lee Department of Electrical Engineering and Computer Sciences University.
Equivalence, DFA, NDFA Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 2 Updated and modified by.
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
EECE Hybrid and Embedded Systems: Computation T. John Koo Institute for Software Integrated Systems Department of Electrical Engineering and Computer.
Conformance Simulation Relation ( ) Let and be two automata over the same alphabet simulates () if there exists a simulation relation such that Note that.
Review of “Embedded Software” by E.A. Lee Katherine Barrow Vladimir Jakobac.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
EECE Hybrid and Embedded Systems: Computation
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Causality Interfaces and Compositional Causality Analysis Rachel Zhou UC Berkeley.
NSF Foundations of Hybrid and Embedded Software Systems UC Berkeley: Chess Vanderbilt University: ISIS University of Memphis: MSI A New System Science.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
EECE Hybrid and Embedded Systems: Computation T. John Koo, Ph.D. Institute for Software Integrated Systems Department of Electrical Engineering and.
Designing Predictable and Robust Systems Tom Henzinger UC Berkeley and EPFL.
Topics Automata Theory Grammars and Languages Complexities
ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)
ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)
MOBIES Project Progress Report Engine Throttle Controller Design Using Multiple Models of Computation Edward Lee Haiyang Zheng with thanks to Ptolemy Group.
Department of Electrical Engineering and Computer Sciences University of California at Berkeley The Ptolemy II Framework for Visual Languages Xiaojun Liu.
COMPUTATIONAL MODELING FOR ENGINEERING MECN 6040 Professor: Dr. Omar E. Meza Castillo Department.
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
FPGA-Based System Design: Chapter 5 Copyright  2004 Prentice Hall PTR Topics n Basics of sequential machines. n Sequential machine specification. n Sequential.
Ch.2 Part A: Requirements, State Charts EECE **** Embedded System Design.
Rosen 5th ed., ch. 11 Ref: Wikipedia
November 21, 2005 Center for Hybrid and Embedded Software Systems Tivadar Szemethy, Institute for Software Integrated Systems, Vanderbilt University A.
Composing Models of Computation in Kepler/Ptolemy II
Lecture 23: Finite State Machines with no Outputs Acceptors & Recognizers.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
REGULAR LANGUAGES.
AUTOMATA THEORY Reference Introduction to Automata Theory Languages and Computation Hopcraft, Ullman and Motwani.
By: Er. Sukhwinder kaur.  What is Automata Theory? What is Automata Theory?  Alphabet and Strings Alphabet and Strings  Empty String Empty String 
Hybrid automata and temporal logics
Submodule construction in logics 1 Gregor v. Bochmann, University of Ottawa Using First-Order Logic to Reason about Submodule Construction Gregor v. Bochmann.
Future Work  Formal specification of modeling language semantic is key issue  Reliance on well-established formal models of computation (i.e. finite.
Finite State Machines 1.Finite state machines with output 2.Finite state machines with no output 3.DFA 4.NDFA.
Presentation.  Julius Richard Büchi (1924–1984)  Swiss logician and mathematician.  He received his Dr. sc. nat. in 1950 at the ETH Zürich  Purdue.
Computation Theory Asia Mahdi. Textbooks Programs, Machines and Computation: An Introduction to the Theory of Computing - Authors: Keith Clark and Don.
Department of Software & Media Technology
Theory of Computation Automata Theory Dr. Ayman Srour.
Automata-Based Programming
Formal Methods in software development
Non Deterministic Automata
Deterministic FA/ PDA Sequential Machine Theory Prof. K. J. Hintz
FORMAL LANGUAGES AND AUTOMATA THEORY
Language and Automata Theory
Equivalence, DFA, NDFA Sequential Machine Theory Prof. K. J. Hintz
An Introduction to Finite Automata
Retargetable Model-Based Code Generation in Ptolemy II
High-Level Abstraction of Concurrent Finite Automata
Non-Deterministic Finite Automata
Non Deterministic Automata
The Theory of Computation
Formal Methods in software development
Chapter 1 Regular Language
The Theory of Computation
Teori Bahasa dan Automata Lecture 4: Non-deterministic Finite Automata
Non Deterministic Automata
Presentation transcript:

EECE 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,

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, Harry R. Lewis and Christos H. Papadimitrious, Elements of The Theory of Computation, Prentice Hall, 1998.

5 Relations

6

7

8

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