Lower bounds on lengths of checking sequences
DOI10.1007/S00165-009-0135-6zbMATH Open1214.68216OpenAlexW2050254654WikidataQ130977229 ScholiaQ130977229MaRDI QIDQ613138FDOQ613138
Authors: Guy-Vincent Jourdan, Hasan Ural, Hüsnü Yenigün, Ji Chao Zhang 
Publication date: 17 December 2010
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00165-009-0135-6
Recommendations
- On minimizing the lengths of checking sequences
- Reducing the Lengths of Checking Sequences by Overlapping
- Reduced length checking sequences
- Correction to "Reduced Length Checking Sequences" [Sep 02 93-99]
- A generalized algorithm for constructing checking sequences
- Length lower bounds for reflecting sequences and universal traversal sequences
- Optimal lower and upper bounds for representing sequences
- scientific article; zbMATH DE number 1796968
- Lower bounds on the length of universal traversal sequences
- Lower bound on K-sequence
testingfault detectionmodel-based testingfinite state machineschecking sequence constructiondistinguishing sequences
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- A Method for the Design of Fault Detection Experiments
- On minimizing the lengths of checking sequences
- Reduced length checking sequences
- Reducing the Lengths of Checking Sequences by Overlapping
Cited In (12)
- Reducing the Lengths of Checking Sequences by Overlapping
- Using Distinguishing and UIO Sequences Together in a Checking Sequence
- A generalized algorithm for constructing checking sequences
- On minimizing the lengths of checking sequences
- Reduced length checking sequences
- Testing finite state machines: Fault detection
- The relation between preset distinguishing sequences and synchronizing sequences
- Hardness and inapproximability of minimizing adaptive distinguishing sequences
- Lower bounds for the length of test sequences using UIOs
- Checking Big Suffix and LCP Arrays by Probabilistic Methods
- Title not available (Why is that?)
- Length lower bounds for reflecting sequences and universal traversal sequences
Uses Software
This page was built for publication: Lower bounds on lengths of checking sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q613138)
