scientific article; zbMATH DE number 1015173
The monograph is dedicated to the simulation of some class of complex systems, using a general approach based on so called algorithmic algebras. This class includes many important real processes like manufacturing, automatic control and telecommunications networks. The idea of algorithmic algebras is based on the decomposition of any algorithm in an operating and a controlling part. The construction builds two algebras: \({\mathcal A}\) - which elements are the operators and \({\mathcal B}\) - which elements are the conditions. Some operations are defined, for instance the \(\alpha\)-disjunction : \(_\alpha(S \vee P)\) is equal \(S\) if \(\alpha\) is true respectivelly \(P\) if \(\alpha\) is false. The conditions logic is ternary ( true, false and indefinite). The algebra of conditions can be commutative or non-commutative. The problem of the analysis and the synthesis of discrete automates discussed in both cases. The fundamental facts about algorithmic algebras are described in the first two chapters of the book. In the case of algorithmic algebras with non-commutative algebra of conditions the noncontradictivennes and the completeness of the axiomatic system are proved. Relations to fuzzy sets and fuzzy logic are also given. The last three chapters are concerned with the applications. The proposed stepwise design methodology of analysis and synthesis of complex systems is applied to distributed processing systems, multiprocessor and parallel computers, wide area networks and some economic applications. The book will be usefull to specialists on mathematical cybernetics, economical informatics and system analysis.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338891)