Abstract
Two methods are presented for the harmonization of automata specifications represented in the form of sets of clauses in the language L. Both methods are based on a technique of harmonization of automata that uses their parallel composition. Two ways of defining the semantics of the language L are described that are used in the harmonization methods.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
A. N. Chebotarev, “Regular form of deterministic FSMs specifications in the language L,” Prikl. Diskr. Matemetika., No. 4, 64–72 (2010).
A. N. Chebotarev, “Harmonization of interacting automata,” Cybernetics and Systems Analysis, 51, No. 5, 676–686 (2015).
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).
C.-L. Chang and R. C.-T. Lee, Symbolic Logic and Mechanical Theorem Proving [Russian translation], Nauka, Moscow (1983).
A. N. Chebotarev, “Consistency test for simple specifications of automaton systems,” Cybernetics and Systems Analysis, 30, No. 3, 317–322 (1994).
A. N. Chebotarev, “Separable resolution method for checking the satisfiability of formulas in the language L,” Cybernetics and Systems Analysis, 34, No. 6, 794–799 (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2016, pp. 3–15.
Rights and permissions
About this article
Cite this article
Chebotarev, A.N. Harmonization of Automata Specifications Represented in the Language L. Cybern Syst Anal 52, 341–350 (2016). https://doi.org/10.1007/s10559-016-9834-1
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-016-9834-1