Abstract
Complex system design is treated as a multilevel iterative procedure. An approach to formalized description of the components of a complex system and their interconnections is considered.
Similar content being viewed by others
References
P. M. Ivanov, "Automaton expressions in a system of algorithmic algebras with a commutative algebra of conditions," Kibernetika, No. 2, 16–20 (1978).
P. M. Ivanov, "Decidability of the equivalence problem in a system of algorithmic algebras," Kibernetika, No. 5, 63–66 (1983).
N. P. Buslenko, Complex System Modeling [in Russian], Nauka, Moscow (1987).
A. A. Bakaev, N. I. Kostina, and N. V. Yarovitskii, Automaton Models of Economic Systems [in Russian], Naukova Dumka, Kiev (1970).
V. M. Glushkov and A. A. Letichevskii, "Theory of discrete transformers," in: Selected Topics in Algebra and Logic [in Russian], Nauka, Novosibirsk (1973), pp. 5–39.
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 87–92, July–August, 1992.
Rights and permissions
About this article
Cite this article
Ivanov, P.M. Formalized analysis of complex systems. I. Cybern Syst Anal 28, 562–566 (1992). https://doi.org/10.1007/BF01124992
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01124992