Lower bounds on lengths of checking sequences

DOI10.1007/s00165-009-0135-6zbMath1214.68216OpenAlexW2050254654WikidataQ130977229 ScholiaQ130977229MaRDI QIDQ613138

Guy-Vincent Jourdan, Hüsnü Yenigün, Ji Chao Zhang, Hasan Ural

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

fault detectiontestingmodel-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)

Related Items (2)

Hardness and inapproximability of minimizing adaptive distinguishing sequences ⋮ The relation between preset distinguishing sequences and synchronizing sequences

Uses Software

• AsmL

Cites Work

• Unnamed Item
• Unnamed Item
• On minimizing the lengths of checking sequences
• Reduced length checking sequences
• Reducing the Lengths of Checking Sequences by Overlapping
• Formal Techniques for Networked and Distributed Systems – FORTE 2004
• A Method for the Design of Fault Detection Experiments

This page was built for publication: Lower bounds on lengths of checking sequences