2000 character limit reached
A graph model of message passing processes
Published 1 Jun 2017 in cs.LO and cs.DC | (1706.00266v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.