Finite Automata Course
Description
The course "Finite Automata" is designed to study the capabilities of the "Finite Automata" library of the Engee platform. A finite automaton is a model of an event-driven system that transitions from one operating mode to another when certain conditions are met. Finite automata allow building two types of models: state diagrams and flow diagrams.
Each section contains a theoretical part, practical examples and tasks for independent fulfilment.
Knowledge requirements: Completion of the courses Welcome to Engee course and Visual Modelling Course.
Total course time: ~3 hours.
Course Programme
Introduction to finite automata.
The example of a traffic light model gives an initial idea of the principles of working with finite automata in Engee.
State diagrams.
The construction of state diagrams, the state diagram editor, temporal logic and transitions by default are studied.
Variables and data in state diagrams.
Input and output signals and local variables in state diagrams are studied.
Actions on state diagrams.
Actions with entry, during and exit states as well as actions with conditions are studied.
Execution of state diagrams.
The example details the step-by-step execution of a state diagram: how conditions, actions and transitions between states work.
Project: Robot hoover.
Students are asked to construct a state diagram to model the operation of a robot hoover that can be in one of four states: off, cleaning, parking, and charging.
Flow Diagrams.
The basics of flow diagrams construction are studied. As a practical task, it is proposed to build a model of an iterator that returns to one when the index reaches the maximum value.
Hierarchy of diagrams.
The construction of hierarchical state diagrams is studied. As a practical task it is proposed to build a hierarchical diagram of states describing the operation of a traffic light.