Concurrent NetKAT: Modeling and analyzing stateful, concurrent networks

01/25/2022
by   Jana Wagemaker, et al.
0

We introduce Concurrent NetKAT (CNetKAT), an extension of NetKAT with operators for specifying and reasoning about concurrency in scenarios where multiple packets interact through state. We provide a model of the language based on partially-ordered multisets (pomsets), which are a well-established mathematical structure for defining the denotational semantics of concurrent languages. We provide a sound and complete axiomatization of this model, and we illustrate the use of CNetKAT through examples. More generally, CNetKAT can be understood as an algebraic framework for reasoning about programs with both local state (in packets) and global state (in a global store).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/15/2020

Partially Observable Concurrent Kleene Algebra

We introduce partially observable concurrent Kleene algebra (POCKA), an ...
research
02/24/2022

LAGC Semantics of Concurrent Programming Languages

Formal, mathematically rigorous programming language semantics are the e...
research
11/07/2020

Reasoning about Temporary Coalitions and LTL-definable Ordered Objectives in Infinite Concurrent Multiplayer Games

We propose enhancing the use of propositions for denoting decisions and ...
research
02/06/2020

Convolution and Concurrency

We show how concurrent quantales and concurrent Kleene algebras arise as...
research
05/29/2023

Trace models of concurrent valuation algebras

This paper introduces Concurrent Valuation Algebras (CVAs), extending or...
research
10/16/2020

The Structure of Concurrent Process Histories

We identify the algebraic structure of the material histories generated ...
research
09/13/2018

Improving the Parallel Execution of Behavior Trees

Behavior Trees (BTs) have become a popular framework for designing contr...

Please sign up or login with your details

Forgot password? Click here to reset