A synchronous formal language for programming deterministic finite state machines

摘要

A synchronous formal language is used for programming deterministic finite state machines. The language includes a graphical interface, where the behaviour of a finite state machine is represented as a graph of steps and transitions. Actions are associated with steps. A transition between two steps includes a pause flag, controlling the cycle during which a condition associated to the transition is evaluated; and a pre-emption flag, according to which the condition associated to the transition is evaluated before or after an action associated with the step preceding the transition is executed. The invention makes it possible for the user to have a graphical representation of the attributes of all types of transitions, without the need to use any text. The representation is simple and compact. <IMAGE>