Towards an Analysis of Dynamic Gossip in Netkat

  title={Towards an Analysis of Dynamic Gossip in Netkat},
  author={Malvin Gattinger and Jana Wagemaker},
In this paper we analyse the dynamic gossip problem using the algebraic network programming language Netkat. 

Open Problems in a Logic of Gossips

It is proved that the resulting protocols are implementable and that all aspects of their correctness, including termination, are decidable.

MatchKAT: An Algebraic Foundation For Match-Action

Details of MatchKAT and its metatheory are given, as well as a formal treatment of match expressions on binary strings that form the basis of “match” in match-action, to embark on the first steps in exploring how network programs compiled to match- action rules can be reasoned about formally in a reliable, algebraic way.



Epistemic Protocols for Distributed Gossiping

This work provides an operational semantics of distributed gossip protocols, which are expressed by means of epistemic logic, and sets up an appropriate framework to argue about their correctness.

Parameters for Epistemic Gossip Problems

A framework that can model different kinds of epistemic gossip problems is introduced and some parameters that distinguish the different types of gossip problem are formalized.

Epistemic protocols for dynamic gossip

Dynamic Gossip

A gossip protocol is a procedure for spreading secrets among a group of agents, using a connection graph, and it is defined in terms of the topology of the graphs on which they are successful, wherein strong success (the protocol always terminates, possibly assuming fair scheduling) from weak success ( the protocol sometimes terminates).

Knowledge and Gossip

This work investigates epistemic gossip protocols, where an agent a will call another agent not because it is so instructed but based on its knowledge or ignorance of the factual information that is distributed over the network.

Temporal NetKAT

This paper presents a new, unified framework, called Temporal NetKAT, capable of facilitating all of these tasks at once: past-time (finite trace) linear temporal logic and (network) Kleene Algebra with Tests.

Common Knowledge in a Logic of Gossips

It is shown that the semantics and truth for formulas without nested common knowledge operator are decidable, which implies that implementability, partial correctness and termination of distributed epistemic gossip protocols that use non-nested common knowledge operators is decidable.

Event-driven network programming

This paper proposes NETWORK EVENT STRUCTURES (NESs) to model constraints on updates, such as which events can be enabled simultaneously and causal dependencies between events, and defines an extension of the NetKAT language with mutable state to give semantics to stateful programs using NESs.

NetKAT: semantic foundations for networks

It is shown that NetKAT is an instance of a canonical and well-studied mathematical structure called a Kleene algebra with tests (KAT) and proved that its equational theory is sound and complete with respect to its denotational semantics.

Concurrent Kleene Algebra: Free Model and Completeness

It is proved that the axioms for CKA with bounded parallelism are complete for the semantics proposed in the original paper; consequently, these semantics are the free model for this fragment of CKA.