Cybernetics and Systems Analysis

, Volume 51, Issue 5, pp 676–686 | Cite as

Harmonization of Interacting Automata

  • A. N. Chebotarev


The problem of automata harmonization is to design a system whose behavior during the interaction with its environment meets given requirements regardless of the behavior of the environment. A number of theoretical results employed in solving the harmonization problem and corresponding algorithms based on these results are presented.


interaction of automata composition of automata automaton shift with respect to input harmonization of automata correctness of a composition 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A. Church, “Applications of recursive arithmetic to the problem of circuit synthesis,” in: Summaries of the Summer Inst. for Symbolic Logic, Cornell Univ., New York (1957), pp. 3–50.Google Scholar
  2. 2.
    O. Kupferman, “Recent challenges and ideas in temporal synthesis,” in: Proc. 38th Conf. on Theory and Practice of Computer Science (SOFSEM 2012): Lect. Notes Comput. Sci., 7147, 88–98 (2012).Google Scholar
  3. 3.
    B. Alpern and F. B. Schneider, “Defining liveness,” Information Processing Letters, 21, No. 4, 181–185 (1985).MATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    A. N. Chebotarev, “Interacting automata,” Cybernetics and Systems Analysis, 27, No. 6, 810–819 (1991).MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    A. N. Chebotarev, “General method of testing the compatibility of interacting automata with finite memory,” Cybernetics and Systems Analysis, 35, No. 6, 867–874 (1999).MATHMathSciNetCrossRefGoogle Scholar
  6. 6.
    A. Pnueli and R. Rosner, “On the synthesis of a reactive module,” in: Proc. 16th ACM Symp. on Principles of Programming Languages: ACM Press, New York (1989), pp. 179–190.Google Scholar
  7. 7.
    M. Abadi, L. Lamport, and P. Wolper, “Realizable and unrealizable specifications of reactive systems,” in: Intern. Colloquium on Automata, Languages, and Programming: Lect. Notes Comput. Sci., 372, 1–17 (1989).Google Scholar
  8. 8.
    R. Alur and S. La Torre, “Deterministic generators and games for LTL fragments,” ACM Trans. Computational Logic, 5, No. 1, 1–25 (2004).CrossRefGoogle Scholar
  9. 9.
    N. Piterman, A. Pnueli, and Y. Sa’ar, “Synthesis of reactive(1) designs,” in: Proc. Intern. Conf. on Verification, Model Checking, and Abstract Interpretation: Lect. Notes Comput. Sci., 3855, 364–380 (2006).Google Scholar
  10. 10.
    O. Kupferman, P. Madhusudan, P. S. Thiagarajan, and M. Vardi, “Open systems in reactive environments: Control and synthesis,” in: Proc. 11th Intern. Conf. on Concurrency Theory: Lect. Notes Comput. Sci., 1877, 92–107 (2000).Google Scholar
  11. 11.
    V. Singhal and C. Pixley, “The verification problem for safe replaceability,” in: Proc. Conf. on Computer-Aided Verification: Lect. Notes Comput. Sci., 818, 311–323 (1994).Google Scholar
  12. 12.
    S. Qadeer, R. K. Brayton, V. Singhal, and C. Pixley, “Latch redundancy removal without global reset,” in: Proc. Intern. Conf. on Computer Design, S. l: IEEE Computer Society, 432–439 (1996).Google Scholar
  13. 13.
    T. A. Henzinger, S. C. Krishnan, O. Kupferman, and F. Y. C. Mang, “Synthesis of uninitialized systems,” in: Proc. Intern. Colloquium ICALP 2002: Lect. Notes Comput. Sci., 2380, 644–656 (2002).Google Scholar
  14. 14.
    A. N. Chebotarev, “Compositional approach to the development of reactive algorithms,” Cybernetics and Systems Analysis, 49, No. 5, 652–662 (2013).MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.V. M. Glushkov Institute of CyberneticsNational Academy of Sciences of UkraineKyivUkraine

Personalised recommendations