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, 2004, Issue 7, Pages 114–156 (Mi at1610)  

This article is cited in 1 scientific paper (total in 1 paper)

Technical Diagnostics

Enumeration conservation law and natural parallelism of the $D$-algorithms for test generation and modeling in engineering diagnostics

P. A. Pravil'shchikov

State Research Center of Russian Federation, Federal State Unitary Enterprise "Research, Development, and Production Center "Orion", Moscow
Full-text PDF (688 kB) Citations (1)
References:
Abstract: In Part I, typical and minimum diagnostic labyrinths that graphically model generation and modeling of tests were introduced using the $D$-algorithms. Notions of the value of diagnostic enumeration and the minimum value $\mathrm{Pr}_{\min}$ of this enumeration were introduced. A diagnostic unit was introduced for measuring this enumeration. A counterpart of the well-known “physical” Noether theorem was proved relying on the symmetry of the minimum diagnostic labyrinths. The theorem gives rise to the enumeration conservation law $\mathrm{Pr}_{\min}=2N-n-m=\mathrm{const}$ for sequential $D$-algorithms, where $N$ is the number of arcs in the logical network of a combinational device, and $n$ and $m$ are, respectively, the numbers of its external inputs and outputs. Efficiency of the $D$-algorithm was defined, and a formula to calculate it was presented. For the ideal test generator which is a theoretical prototype of the physical generators with scaled, potentially unlimited, throughput, the mechanism of natural parallelism was substantiated. In Part II, described was a mechanism of natural (hypermass) parallelism of the ideal test generator, which uses new parallel-sequential $D$-algorithms to design discrete devices and, thus, appreciably enhance test generation and diagnostic modeling. The mechanism was shown to overcome the lower constraint on the time of solution of the direct and inverse problems which is imposed by the enumeration conservation law for the sequential $D$-algorithms. The spectrum of the parallel-sequential $D$-algorithms was described in general terms. A diagnostic counterpart of the Noether theorem was proved, and the corresponding numerical forms of the enumeration conservation law were deduced for them, as well as for the sequential algorithms. Conclusions substantiated a new direction of the research program for the diagnostic theory of tolerance and similitude – the possibility of using the mechanism of natural parallelism to solve systems of logical, algebraic, and differential equations.
Presented by the member of Editorial Board: P. P. Parkhomenko

Received: 28.12.2001
English version:
Automation and Remote Control, 2004, Volume 65, Issue 7, Pages 1136–1174
DOI: https://doi.org/10.1023/B:AURC.0000038720.82574.0e
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: P. A. Pravil'shchikov, “Enumeration conservation law and natural parallelism of the $D$-algorithms for test generation and modeling in engineering diagnostics”, Avtomat. i Telemekh., 2004, no. 7, 114–156; Autom. Remote Control, 65:7 (2004), 1136–1174
Citation in format AMSBIB
\Bibitem{Pra04}
\by P.~A.~Pravil'shchikov
\paper Enumeration conservation law and natural parallelism of the $D$-algorithms for test generation and modeling in engineering diagnostics
\jour Avtomat. i Telemekh.
\yr 2004
\issue 7
\pages 114--156
\mathnet{http://mi.mathnet.ru/at1610}
\zmath{https://zbmath.org/?q=an:1074.90548}
\transl
\jour Autom. Remote Control
\yr 2004
\vol 65
\issue 7
\pages 1136--1174
\crossref{https://doi.org/10.1023/B:AURC.0000038720.82574.0e}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000223386000010}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84904240768}
Linking options:
  • https://www.mathnet.ru/eng/at1610
  • https://www.mathnet.ru/eng/at/y2004/i7/p114
  • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024