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

DOI10.1093/COMJNL/46.3.307MaRDI QIDQ4415904zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
• On the synthesis of adaptive tests for nondeterministic finite state machines
• On conformance testing of non-deterministic systems
• A testing procedure for deterministic cover finite state machines
• scientific article; zbMATH DE number 6125212

Cited in

(6)

• 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
• Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
• scientific article; zbMATH DE number 6125212 (Why is no real title available?)
• On the synthesis of adaptive tests for nondeterministic finite state machines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4415904)