- 122 Views
- Uploaded on
- Presentation posted in: General

Embedded Systems ECEC 356 –Fall 2014 CAT 268

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Embedded SystemsECEC 356 –Fall 2014 CAT 268

- Chapter 3 – model based design
- Chapter 4 – extended state machines and hybrid automata

Eric Wait

10/7-9/2014

- Last Week – Chapter 2
- This Week – Chapter 3,4
- Next Week – Chapter 4, exam 1

Eric Wait

LEVER 3-D

- Credentials
- "Visualization and Correction of Automated Segmentation, Tracking and Lineaging from 5-D Stem Cell Image Sequences." BMC Bioinformatics 2014
- “Segmentation of Occluded Hematopoietic Stem Cells from Tracking.” EMBC 2014
- "Vertebrate neural stem cell segmentation, tracking and lineaging with validation and editing." Nat. Protocols 2011
- BS,MS in CS UW-Milwaukee
- Professional Photographer

- Passions
- Images (2-D & 3-D)
- Cross discipline presentation
- High Performance Computing
- Computer Building
- Teaching
- Future
- PhD in EE Drexel
- Research in Image Processing

- state

- initial state

- transition

- self loop

- Exercise: From this picture, construct the formal mathematical model.

- A default transition is enabled if no non-default transition is enabled and it either has no guard or the guard evaluates to true. When is the above default transition enabled?

- Stuttering transition: Implicit default transition that is enabled when inputs are absent and that produces absent outputs.
- Receptiveness: For any input values, some transition is enabled. Our structure together with the implicit default transition ensures that our FSMs are receptive.
- Determinism: In every state, for all input values, exactly one (possibly implicit) transition is enabled.

- Nondeterminate model of pedestrians arriving at a crosswalk:
- Formally, the update function is replaced by a function

- FSM behavior is a sequence of (non-stuttering) steps.
- A trace is the record of inputs, states, and outputs in a behavior.
- A computation tree is a graphicalrepresentation of all possible traces.
- FSMs are suitable for formalanalysis. For example, safetyanalysis might show that some unsafestate is not reachable.

- Modeling unknown aspects of the environment or system
- Such as: how the environment changes the iRobot’s orientation

- Hiding detail in a specification of the system
- We will see an example of this later (see notes)

- Any other reasons why nondeterministic FSMs might be preferred over deterministic FSMs?

- Non-deterministic FSMs are more compact than deterministic FSMs
- ND FSM D FSM: Exponential blow-up in #states in worst case

- For a fixed input sequence:
- A deterministic system exhibits a single behavior
- A non-deterministic system exhibits a set of behaviors

- Deterministic FSM behavior for a particular input sequence:

- . . .

- Non-deterministic FSM behavior for an input sequence:

- . . .

- . . .

- . . .

- . . .

- What does receptiveness mean for non-deterministic state machines?
- Non-deterministic Probabilistic

- Source:
- Delphi Automotive Systems (2001)

- initial state

- state

- input

- output

- transition

- Source:
- Delphi Automotive Systems (2001)

- This model enables composition of state machines.

- FSMs provide:
- A way to represent the system for:
- Mathematical analysis
- So that a computer program can manipulate it

- A way to model the environment of a system.
- A way to represent what the system must do and must not do – its specification.
- A way to check whether the system satisfies its specification in its operating environment.

- Understanding states, transitions, inputs and outputs is a key preliminary step to developing a working system!

- HW 3 – due beginning of class 10/14
- Read Chapter 4 of Lee & Seshia
- L&S problems 3.5, 4.1,4.5
- Review Appendix A
- Exam 1 – 10/16!

Andrew R. Cohen

Associate Prof.

Department of Electrical and Computer Engineering

Drexel University

3120 – 40 Market St., Suite 110

Philadelphia, PA 19104

office phone: (215) 571 – 4358

http://bioimage.coe.drexel.edu/courses