Designing tests for automata networks from signal sequences. I. Calculus of generalized asynchronous sequences (Q1821763)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Designing tests for automata networks from signal sequences. I. Calculus of generalized asynchronous sequences |
scientific article; zbMATH DE number 3999835
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Designing tests for automata networks from signal sequences. I. Calculus of generalized asynchronous sequences |
scientific article; zbMATH DE number 3999835 |
Statements
Designing tests for automata networks from signal sequences. I. Calculus of generalized asynchronous sequences (English)
0 references
1986
0 references
A special language is introduced for describing the operation of memory elements and discrete devices in general in which their behavior is specified ''linewise'' rather than ''setwise''. The proposed systematic procedures provide a basis for a new class of test design algorithms.
0 references
memory elements
0 references
discrete devices
0 references
behavior
0 references
test design algorithms
0 references
0.9309735298156738
0 references
0.7914794683456421
0 references
0.7712695002555847
0 references
0.770469069480896
0 references
