Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


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
Bibliographic databases:
Document Type: Article
UDC: 62-504
Language: Russian
Citation: V. V. Rudnev, “Equivalence of discrete systems”, Avtomat. i Telemekh., 1985, no. 11, 128–137; Autom. Remote Control, 46 (1985), 1457–1465
Citation in format AMSBIB
\Bibitem{Rud85}
\by V.~V.~Rudnev
\paper Equivalence of discrete systems
\jour Avtomat. i Telemekh.
\yr 1985
\issue 11
\pages 128--137
\mathnet{http://mi.mathnet.ru/at7643}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=816000}
\zmath{https://zbmath.org/?q=an:0603.68028}
\transl
\jour Autom. Remote Control
\yr 1985
\vol 46
\pages 1457--1465
Linking options:
  • https://www.mathnet.ru/eng/at7643
  • https://www.mathnet.ru/eng/at/y1985/i11/p128
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
    Statistics & downloads:
    Abstract page:93
    Full-text PDF :38
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024