Computing the optimal IO sequences of a protocol in polynomial time

DOI10.1016/0020-0190(91)90170-MzbMath0748.68003OpenAlexW2083777015MaRDI QIDQ1183459

Chuan Yi Tang, Wen-Huei Chen

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90170-m

zbMATH Keywords

protocolprotocol conformance testingfinite-state machineIO sequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Related Items (2)

Efficient minimization of homogeneous FSMs for fault diagnosis ⋮ Synchronization paradigm for protocol testing under multiparty configuration

Cites Work

• Faster algorithms for the shortest path problem
• Unnamed Item

This page was built for publication: Computing the optimal IO sequences of a protocol in polynomial time