Definition and design of strongly language disjoint checkers

dc.contributor.author	Jansch, Ingrid Eleonora Schreiber	pt_BR
dc.contributor.author	Courtois, Bernard	pt_BR
dc.date.accessioned	2011-01-28T05:58:59Z	pt_BR
dc.date.issued	1988	pt_BR
dc.identifier.issn	0018-9340	pt_BR
dc.identifier.uri	http://hdl.handle.net/10183/27550	pt_BR
dc.description.abstract	This paper defines strongly language disjoint (SLD) checkers. SLD checkers are to sequential systems what strongly code disjoint checkers are to combinational systems. SLD checkers are the largest class of checkers with which a functional system may achieve the TSC goal. Self-checking sequential systems are first addressed, then formal definitions of SLD checkers are given. The next point is the design of SLD checkers based on regular combinational self-checking components.	en
dc.format.mimetype	application/pdf	pt_BR
dc.language.iso	eng	pt_BR
dc.relation.ispartof	IEEE Transactions on Computers. New York. vol. 37, n. 6 (june 1988), p. 745-748	pt_BR
dc.rights	Open Access	en
dc.subject	Checkers	en
dc.subject	Circuitos : Auto-teste	pt_BR
dc.subject	Concurrent error detection	en
dc.subject	Self-checking design	en
dc.subject	Sequentially self-checking systems	en
dc.subject	Strongly language disjoint checkers	en
dc.subject	VLSI design	en
dc.title	Definition and design of strongly language disjoint checkers	pt_BR
dc.type	Artigo de periódico	pt_BR
dc.identifier.nrb	000005332	pt_BR
dc.type.origin	Estrangeiro	pt_BR

Este item está licenciado na Creative Commons License