Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine
From MaRDI portal
Publication:4415904
DOI10.1093/comjnl/46.3.307zbMath1027.68079MaRDI QIDQ4415904
Publication date: 7 August 2003
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: http://bura.brunel.ac.uk/handle/2438/345
68Q45: Formal languages and automata
Related Items
On the synthesis of adaptive tests for nondeterministic finite state machines, Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine, Synthesis of distinguishing test cases for timed finite state machines, Conformance Tests as Checking Experiments for Partial Nondeterministic FSM