The following pages link to (Q4234083):
Displaying 17 items.
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- The complexity of asynchronous model based testing (Q714798) (← links)
- On the undecidability of probabilistic planning and related stochastic optimization problems (Q814465) (← links)
- On the synthesis of adaptive tests for nondeterministic finite state machines (Q840063) (← links)
- Adaptive distinguishing test cases of nondeterministic finite state machines: test case derivation and length estimation (Q1707350) (← links)
- Synthesis of distinguishing test cases for timed finite state machines (Q1758682) (← links)
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine (Q1882901) (← links)
- Synthesizing adaptive test strategies from temporal logic specifications (Q2280227) (← links)
- POMDPs under probabilistic semantics (Q2344358) (← links)
- Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
- Describing Homing and Distinguishing Sequences for Nondeterministic Finite State Machines via Synchronizing Automata (Q2947421) (← links)
- Play to Test (Q3434603) (← links)
- A Note on an Anomaly in Black-Box Testing (Q3434604) (← links)
- Conformance Tests as Checking Experiments for Partial Nondeterministic FSM (Q3434606) (← links)
- (Q5146121) (← links)
- Preset and Adaptive Homing Experiments for Nondeterministic Finite State Machines (Q5200066) (← links)
- A survey on observability of Boolean control networks (Q6063112) (← links)
