finite state automaton (FSA)

Definition for: finite state automaton (FSA)

Alphabetic selection:

Definition:

finite state automaton (FSA)

FSA is an abstraction to describe the behavior of a black box. It is composed of several states, transitions between those states, and actions.

Source CANdictionary (2016) - CiA CAN in Automation - www.can-cia.org