Chebotarev A.N.
Synthesis of Σ-automata specified in the first-order logical languages LP and LF

This paper presents methods for synthesizing Σ-automata from specifications in the language LP with deterministic semantics and in the language LF with nondeterministic semantics. These methods are based on the equivalent transformation of a formula of the form ∀tF (t) into the so-called normal form whose structure corresponds to the state transition graph of a specified Σ-automaton. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: automaton semantics, LF formula, LP formula, normal form, orthogonalization, Σ-automaton, Automata theory, Formal logic, Deterministic semantics, Equivalent transformations, LF formula, Logical language, LP formula, Normal form, Orthogonalization, State transition graphs, Semantics

Cite:
Chebotarev A.N. (2018). Synthesis of Σ-automata specified in the first-order logical languages LP and LF. Cybernetics and Systems Analysis, 54 (4), 16-31. doi: https://doi.org/10.1007/s10559-018-0054-8 http://jnas.nbuv.gov.ua/article/UJRN-0000889042 [In Russian].