Skip to main content
SpringerLink
Log in

Synthesis of Σ-Automata Specified in the First Order Logical Languages LP and LF

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. N. Chebotarev, “Regular form of deterministic FSMs specification in the language L,” Applied Discrete Mathematics, No. 4, 64–72 (2010).

  2. A. N. Chebotarev, “Extension of the automaton specification logical language and the synthesis problem,” Cybernetics and Systems Analysis, Vol. 32, No. 6, 756–765 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  3. A. N. Chebotarev, “Some subsets of monadic first-order logic (MFO) used for the specification and synthesis of Σ-automata,” Cybernetics and Systems Analysis, Vol. 53, No. 4, 512–523 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  4. A. N. Chebotarev, “Synthesis of a procedural representation of an automaton specified in the logical language L*. I,” Cybernetics and Systems Analysis, Vol. 33, No. 4, 505–515 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  5. A. N. Chebotarev, “Problems of synthesis of Σ-automata specified in languages LP and LF of first-order logic,” Cybernetics and Systems Analysis, Vol. 53, No. 5, 675–683 (2017).

    Article  MathSciNet  MATH  Google Scholar 

  6. N. E. Kobrinskii and B. A. Trakhtenbrot, Introduction to the Theory of Finite Automata [in Russian], Fizmatgiz, Moscow (1962).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine

    A. N. Chebotarev

Authors
  1. A. N. Chebotarev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. N. Chebotarev.

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, July–August, 2018, pp. 16–31.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chebotarev, A.N. Synthesis of Σ-Automata Specified in the First Order Logical Languages LP and LF. Cybern Syst Anal 54, 527–540 (2018). https://doi.org/10.1007/s10559-018-0054-8

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-018-0054-8

Keywords

Search

Navigation