Using a minimal number of resets when testing from a finite state machine
From MaRDI portal
Publication:2390268
DOI10.1016/j.ipl.2004.03.003zbMath1178.68316OpenAlexW2100196226MaRDI QIDQ2390268
Publication date: 21 July 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://bura.brunel.ac.uk/handle/2438/352
Related Items (2)
Checking sequences for distributed test architectures ⋮ Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata
Cites Work
This page was built for publication: Using a minimal number of resets when testing from a finite state machine
