Efficient minimization of homogeneous FSMs for fault diagnosis

DOI10.1016/S0898-1221(98)00010-8zbMATH Open0903.68009OpenAlexW2086820655MaRDI QIDQ1129532FDOQ1129532

Authors: Rong S. Lin, Maria C. Yuang, Steen J. Hsu 

Publication date: 5 January 1999

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00010-8

Recommendations

• A method for minimizing Moore finite-state machines by merging two states
• Minimization of incompletely specified Mealy finite-state machines by merging two internal states
• Testing finite state machines: Fault detection
• A heuristic algorithm for the minimization of incompletely specified finite state machines
• Abstractions of Finite-State Machines Optimal with Respect to Single Undetectable Output Faults

zbMATH Keywords

finite state machinealternation bit protocolfault diagnosis problemISDN basic rate interfacetransport protocol class 4

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Depth-First Search and Linear Graph Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computing the optimal IO sequences of a protocol in polynomial time

Cited In (3)

• Abstractions of Finite-State Machines Optimal with Respect to Single Undetectable Output Faults
• Title not available (Why is that?)
• Periodic and non-concurrent error detection and identification in one-hot encoded FSMs

This page was built for publication: Efficient minimization of homogeneous FSMs for fault diagnosis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129532)