SWE 3633 Lecture Notes - Lecture 28: Finite-State Machine, Vending Machine, Control Flow
4 May 2017
School
Department
Course
Professor
Document Summary
An fsm consists of a finite set of input symbols, i, a finite set of states, q, a specific state, s, called the starting state, and a transition function, f, from {input x state} to {state}. Transition diagrams - we may represent an fsm by a diagram. A state transition diagram is a technique to depict: the states of an entity, the transitions of states of the entity, the trigger or the event that caused the transition of state of the entity. The end product of a software is a program which executes. Include names another state diagram to be used for. Nested state transition diagram for further refinement: action-expression specifies the activities to be performed. Instead of include, there may be a stubbed state which can be expanded later: the state diagram may contain another state diagram (nested diagram) in its compartment.
