A Formal Method for Determining the Stateof Processors in a Multiprocessor System under Testing

The paper deals with the problem of self-testing of multiprocessor systems within the framework of the Preparata–Metze–Chien model. A method is proposed to formalize the procedure for establishing the state of all processors of the -diagnosable system based on the analysis of the results of a certai...

Full description

Saved in:
Bibliographic Details
Published in:Automation and remote control 2021-01, Vol.82 (3), p.460-467
Main Authors: Romankevich, A M, Morozov, K V, Romankevich, V A
Format: Article
Language:English
Subjects:
Boolean algebra
Formal method
Multiprocessing
Processors
Self testing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 467
container_issue 3
container_start_page 460
container_title Automation and remote control
container_volume 82
creator Romankevich, A M
Morozov, K V
Romankevich, V A
description The paper deals with the problem of self-testing of multiprocessor systems within the framework of the Preparata–Metze–Chien model. A method is proposed to formalize the procedure for establishing the state of all processors of the -diagnosable system based on the analysis of the results of a certain set of mutual test checks by processors. The analysis is reduced to solving a Boolean equation based on the results of these checks and permits one to establish either the state (operational–faulty) of all processors in the system or the fact that the number of checks performed is not sufficient to do so (i.e., the state of some specific processors is undetermined). This remains valid in cases where the number of faulty processors in the system does not exceed .
doi_str_mv 10.1134/S0005117921030061
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2503461990</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2503461990</sourcerecordid><originalsourceid>FETCH-proquest_journals_25034619903</originalsourceid><addsrcrecordid>eNqNi7sKwkAQRRdRMD4-wG7AOjqTjdGU4gMbQYh9CGaikWRXdzeFf28E7a0u3HOOEBPCGZEM5wkiLoiWcUAoESPqCI8iXPkSZdAV3gf7H94XA2vviEQYSE-ka9hrU2cVHNnddA6FNrBlx6YuVamu4G4Micsc6wJORl_YWm0slAoyODaVKx-_E5KXdVxDo3I2cGbr2n4kekVWWR5_dyim-915c_Db7Nm0TnrXjVEtSoMFyjCiOEb5n_UGRcxKvA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2503461990</pqid></control><display><type>article</type><title>A Formal Method for Determining the Stateof Processors in a Multiprocessor System under Testing</title><source>Springer Link</source><creator>Romankevich, A M ; Morozov, K V ; Romankevich, V A</creator><creatorcontrib>Romankevich, A M ; Morozov, K V ; Romankevich, V A</creatorcontrib><description>The paper deals with the problem of self-testing of multiprocessor systems within the framework of the Preparata–Metze–Chien model. A method is proposed to formalize the procedure for establishing the state of all processors of the -diagnosable system based on the analysis of the results of a certain set of mutual test checks by processors. The analysis is reduced to solving a Boolean equation based on the results of these checks and permits one to establish either the state (operational–faulty) of all processors in the system or the fact that the number of checks performed is not sufficient to do so (i.e., the state of some specific processors is undetermined). This remains valid in cases where the number of faulty processors in the system does not exceed .</description><identifier>ISSN: 0005-1179</identifier><identifier>EISSN: 1608-3032</identifier><identifier>DOI: 10.1134/S0005117921030061</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Boolean algebra ; Formal method ; Multiprocessing ; Processors ; Self testing</subject><ispartof>Automation and remote control, 2021-01, Vol.82 (3), p.460-467</ispartof><rights>Pleiades Publishing, Ltd. 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Romankevich, A M</creatorcontrib><creatorcontrib>Morozov, K V</creatorcontrib><creatorcontrib>Romankevich, V A</creatorcontrib><title>A Formal Method for Determining the Stateof Processors in a Multiprocessor System under Testing</title><title>Automation and remote control</title><description>The paper deals with the problem of self-testing of multiprocessor systems within the framework of the Preparata–Metze–Chien model. A method is proposed to formalize the procedure for establishing the state of all processors of the -diagnosable system based on the analysis of the results of a certain set of mutual test checks by processors. The analysis is reduced to solving a Boolean equation based on the results of these checks and permits one to establish either the state (operational–faulty) of all processors in the system or the fact that the number of checks performed is not sufficient to do so (i.e., the state of some specific processors is undetermined). This remains valid in cases where the number of faulty processors in the system does not exceed .</description><subject>Boolean algebra</subject><subject>Formal method</subject><subject>Multiprocessing</subject><subject>Processors</subject><subject>Self testing</subject><issn>0005-1179</issn><issn>1608-3032</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid/><recordid>eNqNi7sKwkAQRRdRMD4-wG7AOjqTjdGU4gMbQYh9CGaikWRXdzeFf28E7a0u3HOOEBPCGZEM5wkiLoiWcUAoESPqCI8iXPkSZdAV3gf7H94XA2vviEQYSE-ka9hrU2cVHNnddA6FNrBlx6YuVamu4G4Micsc6wJORl_YWm0slAoyODaVKx-_E5KXdVxDo3I2cGbr2n4kekVWWR5_dyim-915c_Db7Nm0TnrXjVEtSoMFyjCiOEb5n_UGRcxKvA</recordid><startdate>20210101</startdate><enddate>20210101</enddate><creator>Romankevich, A M</creator><creator>Morozov, K V</creator><creator>Romankevich, V A</creator><general>Springer Nature B.V</general><scope/></search><sort><creationdate>20210101</creationdate><title>A Formal Method for Determining the Stateof Processors in a Multiprocessor System under Testing</title><author>Romankevich, A M ; Morozov, K V ; Romankevich, V A</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_25034619903</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Boolean algebra</topic><topic>Formal method</topic><topic>Multiprocessing</topic><topic>Processors</topic><topic>Self testing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Romankevich, A M</creatorcontrib><creatorcontrib>Morozov, K V</creatorcontrib><creatorcontrib>Romankevich, V A</creatorcontrib><jtitle>Automation and remote control</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Romankevich, A M</au><au>Morozov, K V</au><au>Romankevich, V A</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Formal Method for Determining the Stateof Processors in a Multiprocessor System under Testing</atitle><jtitle>Automation and remote control</jtitle><date>2021-01-01</date><risdate>2021</risdate><volume>82</volume><issue>3</issue><spage>460</spage><epage>467</epage><pages>460-467</pages><issn>0005-1179</issn><eissn>1608-3032</eissn><abstract>The paper deals with the problem of self-testing of multiprocessor systems within the framework of the Preparata–Metze–Chien model. A method is proposed to formalize the procedure for establishing the state of all processors of the -diagnosable system based on the analysis of the results of a certain set of mutual test checks by processors. The analysis is reduced to solving a Boolean equation based on the results of these checks and permits one to establish either the state (operational–faulty) of all processors in the system or the fact that the number of checks performed is not sufficient to do so (i.e., the state of some specific processors is undetermined). This remains valid in cases where the number of faulty processors in the system does not exceed .</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1134/S0005117921030061</doi></addata></record>
fulltext fulltext
identifier ISSN: 0005-1179
ispartof Automation and remote control, 2021-01, Vol.82 (3), p.460-467
issn 0005-1179
1608-3032
language eng
recordid cdi_proquest_journals_2503461990
source Springer Link
subjects Boolean algebra
Formal method
Multiprocessing
Processors
Self testing
title A Formal Method for Determining the Stateof Processors in a Multiprocessor System under Testing
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T00%3A17%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Formal%20Method%20for%20Determining%20the%20Stateof%20Processors%20in%20a%20Multiprocessor%20System%20under%20Testing&rft.jtitle=Automation%20and%20remote%20control&rft.au=Romankevich,%20A%20M&rft.date=2021-01-01&rft.volume=82&rft.issue=3&rft.spage=460&rft.epage=467&rft.pages=460-467&rft.issn=0005-1179&rft.eissn=1608-3032&rft_id=info:doi/10.1134/S0005117921030061&rft_dat=%3Cproquest%3E2503461990%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_25034619903%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2503461990&rft_id=info:pmid/&rfr_iscdi=true