Skip to main content
SpringerLink
Log in

Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language L* to the language L

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

A method for synthesizing an FSM from its specification in the logical language L* is considered. The method is based on translating such a specification into the less expressive language L and applying an available method for synthesizing the sought-for FSM from the specification in this language. The resulting FSM may contain redundant states that are called fictitious and must be eliminated. A simple method for checking states for fictitiousness is proposed.

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, “Extension of the automaton specification logical language and the synthesis problem,” Cybernetics and Systems Analysis, 32, No. 6, 756–765 (1996).

    Article  MathSciNet  MATH  Google Scholar 

  2. A. N. Chebotarev, “Approach to functional specification of automaton systems,” Cybernetics and Systems Analysis, 29, No. 3, 330–337 (1993).

    Article  MathSciNet  Google Scholar 

  3. A. Gill, Introduction to the Theory of Finite-State Machines [Russian translation], Nauka, Moscow (1966).

    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, 33, No. 4, 505–515 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  5. A. N. Chebotarev, “Synthesis of a procedural representation of an automaton specified in the logical language L*. II,” Cybernetics and Systems Analysis, 33, No. 6, 845–853 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  6. A. N. Chebotarev, “Transformation of a language L* specification of an FSM into an automata equivalent specification in the language L,” Cybernetics and Systems Analysis, 46, No. 4, 574–582 (2010).

    Article  MathSciNet  Google Scholar 

  7. A. N. Chebotarev, “On the class of L*-language formulas that specify finite-memory finite-state machines,” Cybernetics and Systems Analysis, 46, No. 1, 1–6 (2010).

    Article  MathSciNet  MATH  Google Scholar 

  8. A. N. Chebotarev and O. I. Kurivchak, “Allowable transformations of a finite-state machine interacting with its environment,” USiM, No. 1, 38–44 (2010).

Download references

Author information

Authors and Affiliations

  1. V. M. Glushkov Institute of Cybernetics, National Academy of Science 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. 1, January–February, 2013, pp. 3–10.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chebotarev, A.N. Fictitiousness analysis of states of a finite-state machine synthesized from its specification transformed from the language L* to the language L. Cybern Syst Anal 49, 1–6 (2013). https://doi.org/10.1007/s10559-013-9478-3

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-013-9478-3

Keywords

Search

Navigation