Specification of Synchronous Network Flooding in Temporal Logic

Abstract

In distributed network algorithms, network flooding algorithm is considered one of the simplest and most fundamental algorithms. This research specifies the basic synchronous memory-less network flooding algorithm where nodes on the network don’t have memory, for any fixed size of network, in Linear Temporal Logic. The specification can be customized to any single network topology or class of topologies. A specification of the termination problem is formulated and used to compare different topologies for earlier termination. This research gives a worked example of one topology resulting in earlier termination than another, for which we perform a formal verification using the model checker NuSMV

Terminating cases of flooding

“…Such a flooding algorithm would be amnesiac, as the sending of messages would be determined only by the received messages in the previous round. Variations of such algorithms on different topologies can be simulated on a small scale and properties compared using temporal logic model checkers [4].…”