EATMT – Extended finite-state automaton

Block SymbolLicensing group: ADVANCED

Function Description
The EATMT block implements a finite automat with at most 256 states and 256 transition rules, thus it extends the possibilities of the ATMT block.

The current state of the automat $i$, $i=0,1,\dots ,255$ is indicated by individual bits of the integer outputs q0, q1, …, q15. Only a single bit with index $i\mathrm{\text{MOD}}16$ of the $\mathtt{\text{q}}\left(i\mathrm{\text{DIV}}16\right)$ output is set to 1. The remaining bits of that output and the other outputs are zero. The bits are numbered from zero, least significant bit first. Note that the $\mathrm{\text{DIV}}$ and $\mathrm{\text{MOD}}$ operators denote integer division and remainder after integer division respectively. The current state is also indicated by the $\mathtt{\text{ksa}}\in \left\{0,1,\dots ,255\right\}$ output.

The transition conditions $C_k$, $k=0,1,\dots ,255$) are activated by individual bits of the inputs c0, c1, …, c15. The k-th transition condition is fulfilled when the $\left(k\mathrm{\text{MOD}}16\right)$-th bit of the input $\mathtt{\text{c}}\left(k\mathrm{\text{DIV}}16\right)$ is equal to 1. The transition cannot happen otherwise.

The BMHEXD or BMOCT bitwise multiplexers can be used for composition of the input signals c0, c1, …, c15 from individual Boolean signals. Similarly the output signals q0, q1, …, q15 can be decomposed using the BDHEXD or BDOCT bitwise demultiplexers.

The automat function is defined by the following table of transitions:

Each row of this table represents one transition rule. For example the first row

has the meaning

The above described meaning of the table row holds for $C1<1000$. Negation of the $\left(C1-1000\right)$-th transition condition is assumed for $C1\ge 1000$.

The above mentioned table can be easily constructed from the automat state diagram or SFC description (Sequential Function Charts, formerly Grafcet).

The $\mathtt{\text{R1}}=\mathtt{\text{on}}$ input resets the automat to the initial state $S0$. The SET input allows manual transition from the current state to the ns0 state when rising edge occurs. The R1 input overpowers the SET input. The $\mathtt{\text{HLD}}=\mathtt{\text{on}}$ input freezes the automat activity, the automat stays in the current state regardless of the c$i$ input signals and the tstep timer is not incremented. The TOUT output indicates that the machine remains in the given state longer than expected. The time limits $TOi$ for individual states are defined by the touts array. There is no time limit for the given state when $TOi$ is set to zero. The TOUT output is set to off whenever the automat changes its state.

It is possible to allow more state transitions in one cycle by the morestps parameter. However, this option must be thoroughly considered and tested, namely when the TOUT output is used in transition conditions. In such a case it is strongly recommended to incorporate the ksa output in the transition conditions as well.

The development tools of the REXYGEN system include also the SFCEditor program. You can create SFC schemes graphically using this tool. Run this editor from REXYGEN Studio by clicking the Configure button in the parameter dialog of the EATMT block.

2020 © REX Controls s.r.o., www.rexygen.com