Abstract:
In the framework of abstract conceptions of a discrete system regarded as a system of events the necessary and sufficient conditions of equaivalence are obtained. The systems are compared in terms of repreesentability of languages and sets of a more complex kind, semi- and P-languages which describe parallel (independent) processes occurring in the systems. Conditions for equivalence of Petri nets, automata, multi-processor systems of inter-related graphs, etc. are particular cases of these conditions.
Fulltext:
PDF file (1604 kB)