|
Avtomatika i Telemekhanika, 1985, Issue 11, Pages 128–137
(Mi at7643)
|
|
|
|
Automata
Equivalence of discrete systems
V. V. Rudnev Moscow
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.
Received: 14.06.1984
Citation:
V. V. Rudnev, “Equivalence of discrete systems”, Avtomat. i Telemekh., 1985, no. 11, 128–137; Autom. Remote Control, 46 (1985), 1457–1465
Linking options:
https://www.mathnet.ru/eng/at7643 https://www.mathnet.ru/eng/at/y1985/i11/p128
|
Statistics & downloads: |
Abstract page: | 93 | Full-text PDF : | 38 |
|