Specification and verification of network algorithms using temporal logic

Bani-Abdelrahman, Ra'Ed

doi:10.26174/thesis.lboro.8138030.v1

Cited by 1 publication

(2 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Observe that the notation for bridges just reflects their definition in terms of distributors, as shown in (2), and therefore actually does not constitute an extension to Petri net notation. The notation for losers, duplicators, and duplosers is really an extension, but since these constructs are defined in terms of distributors as well, their notation is only syntactic sugar, which we could drop in favor of the explicit representations shown in Fig.…”

Section: A Language For Communication Networkmentioning

confidence: 99%

See 1 more Smart Citation

Correctness of Broadcast via Multicast: Graphically and Formally

Jeltsch¹,

Díaz²

2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Maintaining data consistency among multiple parties requires nodes to repeatedly send data to all other nodes. For example, the nodes of a blockchain network have to disseminate the blocks they create across the whole network. The scientific literature typically takes the ideal perspective that such data distribution is performed by broadcasting to all nodes directly, while in practice data is distributed by repeated multicast. Since correctness and security of consistency maintenance protocols usually have been established for the ideal setting only, it is vital to show that these properties carry over to real-world implementations. Therefore, it is desirable to prove that the ideal and the real behavior are equivalent.In the work described in this paper, we take an important step towards such a proof by proving a simpler variant of this equivalence statement. The simplification is that we consider only a concrete pair of network topologies, which nevertheless illustrates important phenomena encountered with arbitrary topologies. For describing systems that distribute data, we use a domain-specific language of processes that corresponds to a class of Petri nets and is embedded in a general-purpose process calculus. This way, we can outline our proof using an intuitive graphical notation and leverage the rich theory of process calculi in the actual proof, which is machine-checked using the Isabelle proof assistant.

show abstract

Section: A Language For Communication Networkmentioning

confidence: 99%

“…• Bani-Abdelrahman [2] formally specifies synchronous and bounded asynchronous flooding algorithms using LTL and verifies them using the model checker NuSMV. His results are limited to small network sizes and fixed delays, though.…”

Section: Related Workmentioning

confidence: 99%

Correctness of Broadcast via Multicast: Graphically and Formally

Jeltsch¹,

Díaz²

2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

Specification and verification of network algorithms using temporal logic

Cited by 1 publication

References 42 publications

Correctness of Broadcast via Multicast: Graphically and Formally

Correctness of Broadcast via Multicast: Graphically and Formally

Contact Info

Product

Resources

About