Reliable Restricted Process Theory

Article type: Research Article

Authors: Ghassemi, Fatemeh^{a; *} | Fokkink, Wan^b

Correspondence: [*] Address for correspondence: University of Tehran, Tehran, Iran.

Abstract: Malfunctions of a mobile ad hoc network (MANET) protocol caused by a conceptual mistake in the protocol design, rather than unreliable communication, can often be detected only by considering communication among the nodes in the network to be reliable. In Restricted Broadcast Process Theory, which was developed for the specification and verification of MANET protocols, the communication operator is lossy. Replacing unreliable with reliable communication invalidates existing results for this process theory. We examine the effects of this adaptation on the semantics of the framework with regard to the non-blocking property of communication in MANETs, the notion of behavioral equivalence relation and its axiomatization. To utilize our complete axiomatization for analyzing the correctness of protocols at the syntactic level, we introduce a precongruence relation which abstracts away from a sequence of multi-hop communications, leading to an application-level action preconditioned by a multi-hop constraint over the topology. We illustrate the applicability of our framework through a simple routing protocol. To prove its correctness, we introduce a novel proof process, based on our precongruence relation.

Keywords: Mobile ad hoc network, restricted broadcast, process algebra, behavioral congruence, refinement

DOI: 10.3233/FI-2019-1775

Journal: Fundamenta Informaticae, vol. 165, no. 1, pp. 1-41, 2019