Reduced checking sequences using unreliable reset

DOI10.1016/j.ipl.2015.01.002zbMath1327.68160OpenAlexW2028233775MaRDI QIDQ2339596

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

Publication date: 2 April 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.01.002

zbMATH Keywords

formal methodssynchronizing sequencesmodel-based testingfinite state machineschecking sequences

Mathematics Subject Classification ID

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

Related Items (1)

Deriving Homing Sequences for Finite State Machines with Timed Guards

Cites Work

• Unnamed Item
• Testing finite state machines: Fault detection
• Model-based testing of reactive systems. Advanced lectures.
• On the Probability of Being Synchronizable
• Testing Software Design Modeled by Finite-State Machines
• Testing finite-state machines: state identification and verification

This page was built for publication: Reduced checking sequences using unreliable reset