An improved protocol validation technique for a class of communication models

DOI10.1016/0020-0255(86)90042-3MaRDI QIDQ1821089zbMATH OpenOpenAlexFDO

Authors Si-Yeong Hwang, Jung Wan Cho

Publication date 1986

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(86)90042-3

zbMATH Keywords

communicating finite state machinescommunication networksdeadlocksdirected labeled graphprotocol validation algorithmtopologyunspecified receptions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of graph theory to circuits and networks (94C15)

Review text

The topology of a communication network is often represented by a directed labeled graph in which there exists one and only one elementary path from one node to any other node, where nodes and arcs in the graph represent the processes in the communication network and the links between the processes, respectively. In this paper, we propose an algorithm for the validation of the protocols, represented by N (N\(\geq 2)\) communicating finite state machines, in the restricted class of the communication networks with such topology. The algorithm can detect deadlocks and unspecified receptions, and saves time and/or storage in comparison with the conventional perturbation technique.

Recommendations

• scientific article; zbMATH DE number 2080915
• Protocol validation by fair progress state exploration
• On Communicating Finite-State Machines
• Protocol validation — principles and applications
• scientific article; zbMATH DE number 3892605

Cites work

• Deadlock Detection for a Class of Communicating Finite State Machines

Cited in

(5)

• A new formal method for communication protocol specification
• Protocol validation by fair progress state exploration
• scientific article; zbMATH DE number 4058838 (Why is no real title available?)
• Protocol validation — principles and applications
• scientific article; zbMATH DE number 2080915 (Why is no real title available?)

This page was built for publication: An improved protocol validation technique for a class of communication models

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