# A graph model of message passing processes

## TL;DR

This paper introduces a graph-based model for message passing processes and presents a verification method, demonstrated through the example of verifying a sliding window protocol.

## Contribution

It proposes a novel graph model for message passing and a verification method, applied to a specific protocol example.

## Key findings

- Successful verification of the sliding window protocol
- The graph model effectively captures message passing behaviors
- The method provides a systematic approach for process verification

## 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.