A graph model of message passing processes
classification
💻 cs.LO
cs.DC
keywords
messagepassingprocessesgraphmethodmodelverificationconsider
read the original abstract
In the paper we consider a graph model of message passing processes and present a method verification of message passing processes. The method is illustrated by an example of a verification of sliding window protocol.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.