Verifying the timing of a persistent storage for stateful fog applications

In this paper, we analyze the failure semantics of a persistent fault-tolerant storage solution for stateful fog applications. This storage system is a container-based solution that provides data availability and consistency in a distributed container-based fog architecture. We evaluate the behavior of this storage system with a formal model that includes all the important time parameters and temporal aspects of the solution. This allows us to verify data consistency and other fault-tolerance properties of our system model while considering application startup latency, together with synchronization intervals and delays. We prove that the solution can tolerate failures at application, node, communication and storage level with the ability to automatically recover from failures and provides data consistency within the synchronization delay defined as t time units, which we can calculate for a given system configuration.