Skip to main content
SpringerLink
Log in

Harmonization of Interacting Automata

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

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.

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.

Similar content being viewed by others

References

  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.

  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).

  3. B. Alpern and F. B. Schneider, “Defining liveness,” Information Processing Letters, 21, No. 4, 181–185 (1985).

    Article  MATH  MathSciNet  Google Scholar 

  4. A. N. Chebotarev, “Interacting automata,” Cybernetics and Systems Analysis, 27, No. 6, 810–819 (1991).

    Article  MATH  MathSciNet  Google Scholar 

  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).

    Article  MATH  MathSciNet  Google Scholar 

  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.

  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).

  8. R. Alur and S. La Torre, “Deterministic generators and games for LTL fragments,” ACM Trans. Computational Logic, 5, No. 1, 1–25 (2004).

    Article  Google Scholar 

  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).

  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).

  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).

  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).

  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).

  14. A. N. Chebotarev, “Compositional approach to the development of reactive algorithms,” Cybernetics and Systems Analysis, 49, No. 5, 652–662 (2013).

    Article  MATH  MathSciNet  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. 5, September–October, 2015, pp. 13–25.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chebotarev, A.N. Harmonization of Interacting Automata. Cybern Syst Anal 51, 676–686 (2015). https://doi.org/10.1007/s10559-015-9759-0

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-015-9759-0

Keywords

Search

Navigation