A Modular Framework for Verifying Versatile Distributed Systems

Abstract

Putting independent components together is a common design practice of distributed systems. Besides, there exists a wide range of interaction protocols that dictate how these components interact, which impacts their compatibility. However, the communication model itself always consists in a monolithic description of the rules and properties of the communication. In this paper, we propose a mechanized framework for the compatibility checking of compositions of peers where the interaction protocol can be fine tuned through assembly of individual properties on the communication. These include whether the communication is point-to-point or multicast, which ordering-policies are to be applied, applicative priorities, bounds on the number of messages in transit, and so on. Among these properties, we focus on a generic description of multicast communication that encompasses point-to-point and one-to-all communication as special cases. Eventually we provide theoretical views on the relations between ordering-policies through the lenses of multicast communication.

A First-Order Logic Semantics for Communication-Parametric BPMN Collaborations

“…An on-going work is to replace the network theories that specify the communication model with a more general and versatile solution based on a communication framework we have developed [6]. This framework allows a large variety of configurations for the communication model, including which ordering policies are to be applied per participant, per couples of communicating participants, using priorities, or bounds on the number of messages in transit.…”