Pages that link to "Item:Q3417008"
From MaRDI portal
The following pages link to On minimizing the lengths of checking sequences (Q3417008):
Displayed 10 items.
- Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811) (← links)
- Lower bounds on lengths of checking sequences (Q613138) (← links)
- Checking experiments for stream X-machines (Q987982) (← links)
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine (Q1882901) (← links)
- Checking sequences for distributed test architectures (Q2377256) (← links)
- Removing redundant refusals: minimal complete test suites for failure trace semantics (Q2687991) (← links)
- MODEL PARTITIONS AND COMPACT TEST CASE SUITES (Q2909189) (← links)
- Hardness of Deriving Invertible Sequences from Finite State Machines (Q2971131) (← links)
- Minimizing Coordination Channels in Distributed Testing (Q3613091) (← links)
- Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279) (← links)