Harmonization of Interacting Automata
- 40 Downloads
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.
Keywordsinteraction 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.
- 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.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
- 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.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
- 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.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.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.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.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