Adaptive tests derivation for nondeterministic automata
zbMATH Open1468.68114MaRDI QIDQ5146121FDOQ5146121
Authors: N. V. Yevtushenko, Maksim Leonidovich Gromov 
Publication date: 25 January 2021
Full work available at URL: http://mathnet.ru/eng/pdm152
Recommendations
- Synthesis of distinguishing test cases for timed finite state machines
- Distinguishing and control experiments with nondeterministic automata
- Adaptive Testing of a Deterministic Implementation Against a Nondeterministic Finite State Machine
- On the synthesis of adaptive tests for nondeterministic finite state machines
- Distinguishing experiments for timed nondeterministic finite state machines
compatibilitynondeterministic finite-state machinelabelled transition systemsadaptive experimentdistinguishing experimenttimed finite-state machine
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
Cited In (9)
- Using Model Counting to Find Optimal Distinguishing Tests
- On the synthesis of adaptive tests for nondeterministic finite state machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Synthesis of distinguishing test cases for timed finite state machines
- Distinguishing and control experiments with nondeterministic automata
- Test suites derivation for nondeterministic finite state machines with respect to the separability relation
- Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation
- Distinguishing experiments for timed nondeterministic finite state machines
This page was built for publication: Adaptive tests derivation for nondeterministic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146121)
