RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

Prikl. Diskr. Mat., 2010 Number 3(9), Pages 100–110 (Mi pdm236)

Logical Design of Discrete Automata

Solving inequalities over finite state machines in the reactive systems design

A. N. Chebotarev

Institute of Cybernetics NAS Ukraine, Kiev, Ukraine

Abstract: The problem of solving inequalities over finite state machines (FSMs) is considered. This problem arises in compositional approach to the design of reactive systems. The problem is formulated and solved at the level of FSMs specifications in the logical language $L$. We show how to compute the maximal solution to the inequality with respect to the operation of synchronous composition of FSMs.

Keywords: reactive system, language $L$ specification, $\Sigma$-automaton, synchronous composition of $\Sigma$-automata, inequality over $\Sigma$-automata, maximal solution.

UDC: 621.391.1+004.7



© Steklov Math. Inst. of RAS, 2026