Using a minimal number of resets when testing from a finite state machine (Q2390268): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q347399 |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Robert M. Hierons / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2100196226 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3684121 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3239817 / rank | |||
Normal rank |
Latest revision as of 20:02, 1 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Using a minimal number of resets when testing from a finite state machine |
scientific article |
Statements
Using a minimal number of resets when testing from a finite state machine (English)
0 references
21 July 2009
0 references
finite state machine
0 references
test generation algorithm
0 references
reset
0 references
minimization
0 references
graph algorithms
0 references