Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine

DOI10.1093/comjnl/46.3.307zbMath1027.68079OpenAlexW2170006923MaRDI QIDQ4415904

Robert M. Hierons

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

zbMATH Keywords

deterministic finite-state machine

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

On the synthesis of adaptive tests for nondeterministic finite state machines ⋮ Synthesis of distinguishing test cases for timed finite state machines ⋮ Testing a deterministic implementation against a non-controllable non-deterministic stream X-machine ⋮ Conformance Tests as Checking Experiments for Partial Nondeterministic FSM

This page was built for publication: Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine