Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
From MaRDI portal
Publication:4245976
DOI10.1093/COMJNL/41.5.349zbMATH Open0921.68032OpenAlexW2100596986MaRDI QIDQ4245976FDOQ4245976
Authors: Robert M. Hierons 
Publication date: 31 May 1999
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: http://bura.brunel.ac.uk/handle/2438/348
Recommendations
- Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine
- On the synthesis of adaptive tests for nondeterministic finite state machines
- Adaptive tests derivation for nondeterministic automata
- On conformance testing of non-deterministic systems
- A testing procedure for deterministic cover finite state machines
Cited In (20)
- Conformance Tests as Checking Experiments for Partial Nondeterministic FSM
- On the synthesis of adaptive tests for nondeterministic finite state machines
- On testing UML statecharts
- The complexity of checking the existence and derivation of adaptive synchronizing experiments for deterministic FSMs
- A Formal Approach to Heuristically Test Restorable Systems
- A testing procedure for deterministic cover finite state machines
- Testing finite state machines: Fault detection
- The complexity of asynchronous model based testing
- Synthesis of distinguishing test cases for timed finite state machines
- Checking experiments for stream X-machines
- Adaptive tests derivation for nondeterministic automata
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
- Testing restorable systems: formal definition and heuristic solution based on river formation dynamics
- Complete open-state testing of limitedly nondeterministic systems
- Test suites derivation for nondeterministic finite state machines with respect to the separability relation
- Test suites derivation for nondeterministic finite state machines with respect to the separability relation
- Test selection for traces refinement
- Reducing the cost of applying adaptive test cases
- Generating Candidates When Testing a Deterministic Implementation against a Non-deterministic Finite-state Machine
- Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation
This page was built for publication: Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4245976)
