Protocol validation by fair progress state exploration

DOI10.1016/0169-7552(85)90086-8zbMath0576.68047OpenAlexW1987377075MaRDI QIDQ3696532

Ji-Yun Han, Mohamed G. Gouda

Publication date: 1985

Published in: Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0169-7552(85)90086-8

zbMATH Keywords

reachability graphFIFO channelscomputer network protocolscommunicating finite state machinescomputing channel capacities

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Exposure to deadlock for communicating processes is hard to detect

This page was built for publication: Protocol validation by fair progress state exploration