Abstract
A method is proposed for compatibility analysis of two interacting partial nondeterministic automata A and B specified in a first-order language with monadic predicates. In contrast to a method proposed earlier, no restrictions are imposed on the form of specification of the automaton B.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. N. Chebotarev, “Interacting automata,” Kibern. Sist. Anal., No. 6, 17–29 (1991).
M. K. Morokhovets and A. N. Chebotarev, “Resolution approach to testing compatibility of interacting automata,” Kibern. Sist. Anal., No. 6, 36–50 (1994).
A. N. Chebotarev, “Separable resolution method for checking the satisfiability of formulas in the language Ω,” Kibern. Sist. Anal., No. 6, 13–20 (1998).
A. N. Chebotarev, “Consistency test for simple specifications of automaton systems,” Kibern. Sist. Anal., No. 3, 3–11 (1994).
A. N. Chebotarev, “Approach to functional specification of automaton systems. I,” Kibern. Sist. Anal., No. 3, 31–42 (1993).
Author information
Authors and Affiliations
Additional information
These investigations were partially supported by INTAS grant 96-0760.
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 25–37, November–December, 1999.
Rights and permissions
About this article
Cite this article
Chebotarev, A.N. General method of testing the compatibility of interacting automata with finite memory. Cybern Syst Anal 35, 867–874 (1999). https://doi.org/10.1007/BF02742277
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02742277