Lower bounds on lengths of checking sequences

DOI10.1007/S00165-009-0135-6MaRDI QIDQ613138zbMATHOpenAlexWikidataFDO

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

zbMATH Keywords

testingfault detectionmodel-based testingfinite state machineschecking sequence constructiondistinguishing sequences

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

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

Cites work

• scientific article; zbMATH DE number 3598362 (Why is no real title available?)
• scientific article; zbMATH DE number 3254909 (Why is no real title available?)
• A Method for the Design of Fault Detection Experiments
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• On minimizing the lengths of checking sequences
• Reduced length checking sequences
• Reducing the Lengths of Checking Sequences by Overlapping

Cited in

(14)

• Lower bounds for the length of test sequences using UIOs
• Length lower bounds for reflecting sequences and universal traversal sequences
• Reducing the Lengths of Checking Sequences by Overlapping
• Conformance testing in the presence of multiple faults
• scientific article; zbMATH DE number 820496 (Why is no real title available?)
• The relation between preset distinguishing sequences and synchronizing sequences
• Checking Big Suffix and LCP Arrays by Probabilistic Methods
• On minimizing the lengths of checking sequences
• Reduced length checking sequences
• A generalized algorithm for constructing checking sequences
• Reduced checking sequences using unreliable reset
• Using Distinguishing and UIO Sequences Together in a Checking Sequence
• Testing finite state machines: Fault detection
• Hardness and inapproximability of minimizing adaptive distinguishing sequences

Describes a project that uses

Uses Software

• AsmL

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)